Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs

DOI10.1007/s10626-011-0100-4zbMath1231.05255OpenAlexW1969752454MaRDI QIDQ539486

Kamel Barkaoui, Hanifa Boucheneb

Publication date: 30 May 2011

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-011-0100-4

zbMATH Keywords

Petri netsreachability graphsTPN model

Mathematics Subject Classification ID

Applications of graph theory (05C90) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Time based deadlock prevention for Petri nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On-the-fly \(TCTL\) model checking for time Petri nets
• CTL* model checking for time Petri nets
• Model Checking Bounded Prioritized Time Petri Nets
• TCTL Model Checking of Time Petri Nets
• State space computation and analysis of Time Petri Nets
• Applications and Theory of Petri Nets 2004