Abstract
A subclass of Petri nets called live and safe free choice nets (LSFC nets) is studied. LSFC nets model distributed systems that can exhibit both nonsequential and nondeterministic behaviours. It is shown that the restricted combination of concurrency and choice as represented by LSFC nets leads to a number of attractive system properties. It is also shown, through examples, that a “less” restrictive combination of concurrency and choice destroys these properties.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
