A partial order method for the verification of time Petri nets
From MaRDI portal
(Redirected from A partial order method for the verification of time Petri nets)
Recommendations
- The use of partial-order technique for verification of time Petri nets
- scientific article; zbMATH DE number 1439078
- Abstractions and partial order reductions for checking branching properties of time Petri nets
- Model checking of time Petri nets based on partial order semantics
- Applications and Theory of Petri Nets 2004
Cited in
(15)- A theory of implementation and refinement in timed Petri nets
- Reduction rules for time Petri nets
- Using integer time steps for checking branching time properties of time Petri nets
- Model checking of time Petri nets based on partial order semantics
- A temporal logic approach to implementation and refinement in timed Petri nets
- Timed Petri nets and BQOs
- Abstractions and partial order reductions for checking branching properties of time Petri nets
- scientific article; zbMATH DE number 1836392 (Why is no real title available?)
- scientific article; zbMATH DE number 1439078 (Why is no real title available?)
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Delay-Dependent Partial Order Reduction Technique for Time Petri Nets
- Using forward reachability analysis for verification of timed Petri nets
- A method for parametric verification of the behavior of time Petri nets
- The use of partial-order technique for verification of time Petri nets
- Verifying time Petri nets by linear programming
This page was built for publication: A partial order method for the verification of time Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934360)