Abstract
For practical reasons, the live and bounded marked Petri nets are considered in this paper. The cycle time problem (CTP) for timed marked Petri nets (TMPNs) is analysed. For conflict-free TMPNs without self-loops, the polynomial algorithm for CTP are given. For conflict-free and persistent TMPNs, the strong NP-hardness of CTP is proved.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
