Model checking of time Petri nets based on partial order semantics
From MaRDI portal
Recommendations
Cited in
(18)- A causal semantic for time Petri nets
- Testing equivalences of time Petri nets
- State space analysis of Petri nets with relation-algebraic methods
- `True concurrency' semantics for time Petri nets with weak time and persistent atomic policies
- Back in time Petri nets
- scientific article; zbMATH DE number 1822435 (Why is no real title available?)
- Timed Unfoldings for Networks of Timed Automata
- scientific article; zbMATH DE number 177243 (Why is no real title available?)
- scientific article; zbMATH DE number 177529 (Why is no real title available?)
- Partial order reduction for model checking of timed automata
- scientific article; zbMATH DE number 1755150 (Why is no real title available?)
- scientific article; zbMATH DE number 1759626 (Why is no real title available?)
- A partial order method for the verification of time Petri nets
- Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets
- Formal Modeling and Analysis of Timed Systems
- The use of partial-order technique for verification of time Petri nets
- Time processes for time Petri nets
- On-the-fly TCTL model checking for time Petri nets
This page was built for publication: Model checking of time Petri nets based on partial order semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4270060)