Abstract
This paper proposes a fully expanded tree (FET) approach for one-place-unbounded Petri nets. The FET of a one-place-unbounded Petri net consists of all and only reachable markings from its initial marking. Its applications to liveness and deadlock analysis for such Petri nets are developed. The proposed method has a larger application scope than all the existing methods for them. Several examples are provided to show its superiority over the state-of-the-art methods.
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: Systems
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.
