Abstract
Recursive nested Petri nets may contain marked nets, including their own copies, as their tokens. It is proved that the termination problem is decidable for recursive nested nets with autonomous elements. The expessibility of such nets is compared with other extensions of the Petri net formalism.
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.
