Covering Steps Graphs of Time Petri Nets
From MaRDI portal
Publication:5179058
DOI10.1016/j.entcs.2009.05.037zbMath1347.68254OpenAlexW2027595901MaRDI QIDQ5179058
Kamel Barkaoui, Hanifa Boucheneb
Publication date: 19 March 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2009.05.037
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stutter-invariant temporal properties are expressible without the next-time operator
- Partial-order reduction techniques for real-time model checking
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- CTL* model checking for time Petri nets
- Covering step graph
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- Applications and Theory of Petri Nets 2004
- Formal Modeling and Analysis of Timed Systems
- On Interleaving in Timed Automata
This page was built for publication: Covering Steps Graphs of Time Petri Nets