On Multi-enabledness in Time Petri Nets

DOI10.1007/978-3-642-38697-8_8zbMath1381.68196OpenAlexW63786410MaRDI QIDQ5300869

Hanifa Boucheneb, Didier Lime, Olivier H. Roux

Publication date: 28 June 2013

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38697-8_8

zbMATH Keywords

time Petri netsfiring choice policiesmultiple/single-server semanticsstrong/weak timed simulations

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Delay-dependent partial order reduction technique for real time systems ⋮ `True concurrency' semantics for time Petri nets with weak time and persistent atomic policies ⋮ Combining free choice and time in Petri nets ⋮ Decidable Classes of Unbounded Petri Nets with Time and Urgency ⋮ Time based deadlock prevention for Petri nets

This page was built for publication: On Multi-enabledness in Time Petri Nets