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

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

Pritha Mahata, Parosh Aziz Abdulla, Richard Mayr

Publication date: 11 October 2007

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

Related Items (6)

Weak Time Petri Nets Strike Back! ⋮ Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets ⋮ Universal safety for timed Petri nets is PSPACE-complete ⋮ Dynamic Networks of Timed Petri Nets ⋮ Verification of Timed-Arc Petri Nets ⋮ Decidable Classes of Unbounded Petri Nets with Time and Urgency

This page was built for publication: Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness