Abstract
A modified reachability tree (MRT) for Petri nets which extends the ability of Karp-Miller's finite reachability tree (FRT) in solving the liveness and reachability problems, and in defining or determining possible firing sequences is given. The finiteness of MRT is proved and several interesting examples are presented to illustrate the difference between MRT and FRT. >
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.
