Abstract

The authors describe the resource sharing interaction between subprocesses, which frequently appear in automated manufacturing systems, using the deviation bound. The results are used for synthesizing Petri nets in which liveness and boundedness are guaranteed. A shared resource net that can be considered a basic formulation for handling shared resource problems is introduced. A weighted deviation bound is introduced and used to characterize concurrency in generalized Petri nets. >

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.