Covering steps graphs of time Petri nets
From MaRDI portal
Recommendations
Cites work
- A more efficient time Petri net state space abstraction useful to model checking timed linear properties
- Applications and Theory of Petri Nets 2004
- Covering step graph
- CTL* model checking for time Petri nets
- Formal Modeling and Analysis of Timed Systems
- scientific article; zbMATH DE number 177237 (Why is no real title available?)
- scientific article; zbMATH DE number 1956600 (Why is no real title available?)
- scientific article; zbMATH DE number 1755150 (Why is no real title available?)
- On Interleaving in Timed Automata
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Partial-order reduction techniques for real-time model checking
- Stutter-invariant temporal properties are expressible without the next-time operator
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
Cited in
(3)
This page was built for publication: Covering steps graphs of time Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5179058)