Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness

DOI10.2168/LMCS-3(1:1)2007zbMath1128.68057MaRDI QIDQ5310677

Richard Mayr, Parosh Aziz Abdulla, Pritha Mahata

Publication date: 11 October 2007

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

68Q60: Specification and verification (program logics, model checking, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

03B25: Decidability of theories and sets of sentences

Related Items

Dynamic Networks of Timed Petri Nets, Decidable Classes of Unbounded Petri Nets with Time and Urgency, Verification of Timed-Arc Petri Nets, Weak Time Petri Nets Strike Back!, Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets