Abstract
Timed-arc Petri nets (TAPNs) are a timed extension of Petri nets where tokens are assigned an age indicating the time elapsed from its creation, and PT-arcs (place to transition arcs) are labelled with time intervals that are used to restrict the age of the tokens that can be used to fire the adjacent transition. This is a rather pathological model, as reachability is undecidable, whereas some other known properties of Petri nets, like boundedness, coverability and even termination, are decidable. This article focuses on the problem of detecting dead transitions, i.e. transitions that can be removed from the model since they can never become enabled. We prove that this problem is decidable for TAPNs with natural times, and we present an algorithm that can be used to find dead transitions in the particular case of 1-safe TAPNs.
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: Mathematical and Computer Modelling of Dynamical 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.
