Abstract
This paper presents a class of Petri nets, process nets with channels (PNCs) that can model some types of concurrent systems in two aspects: process and interaction. Its significance lies in offering efficient analysis and verification methods for these systems. PNCs belong to the class of extended free choice nets. This paper establishes the conditions to examine their liveness, reversibility, and reachability based on their structural characteristics. Siphons, traps, and a state equation are used to describe these conditions such that analysis techniques based on reachability graphs and siphon enumeration are avoided. A polynomial-time algorithm is presented for the liveness analysis, and an effective method is also given to decide the reachability. A real-world example is used to illustrate the application of PNCs.
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 callMore From: IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
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.
