Abstractions and partial order reductions for checking branching properties of time Petri nets
From MaRDI portal
Recommendations
- A partial order method for the verification of time Petri nets
- The use of partial-order technique for verification of time Petri nets
- A more efficient time Petri net state space abstraction useful to model checking timed linear properties
- CTL* model checking for time Petri nets
- Model checking of time Petri nets based on partial order semantics
Cited in
(8)- CTL* model checking for time Petri nets
- Using integer time steps for checking branching time properties of time Petri nets
- A partial order method for the verification of time Petri nets
- Covering steps graphs of time Petri nets
- Delay-Dependent Partial Order Reduction Technique for Time Petri Nets
- Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets
- The use of partial-order technique for verification of time Petri nets
- On-the-fly TCTL model checking for time Petri nets
This page was built for publication: Abstractions and partial order reductions for checking branching properties of time Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535185)