On Multi-enabledness in Time Petri Nets

DOI10.1007/978-3-642-38697-8_8MaRDI QIDQ5300869zbMATH OpenOpenAlexFDO

Authors H. 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)

Recommendations

• Towards a general model to handle multi-enabledness in time Petri nets
• scientific article; zbMATH DE number 4074793
• The expressive power of time Petri nets
• On the composition of time Petri nets
• On persistency in time Petri nets
• scientific article; zbMATH DE number 1228291
• Petri nets with k simultaneously enabled generally distributed timed transitions
• Time-based expressivity of time Petri nets for system specification
• Expressiveness of dynamic networks of timed Petri nets
• Robustness of time Petri nets under architectural constraints

Cited in

(7)

• Delay-dependent partial order reduction technique for real time systems
• Decidable classes of unbounded Petri nets with time and urgency
• `True concurrency' semantics for time Petri nets with weak time and persistent atomic policies
• Combining free choice and time in Petri nets
• Towards a consistent semantics for unsafe time Petri nets
• Time based deadlock prevention for Petri nets
• Towards a general model to handle multi-enabledness in time Petri nets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300869)