Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs

DOI10.1007/978-3-540-85778-5_19zbMath1171.68564OpenAlexW1582584423MaRDI QIDQ3543303

Hanifa Boucheneb, Kamel Barkaoui

Publication date: 2 December 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85778-5_19

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• CTL* model checking for 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

This page was built for publication: Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs