Forward reachability analysis of timed Petri nets
From MaRDI portal
Recommendations
- Using forward reachability analysis for verification of timed Petri nets
- Reachability analysis of (timed) Petri nets using real arithmetic
- Symbolic Reachability Analysis of Integer Timed Petri Nets
- A partial order method for the verification of time Petri nets
- Verification of reachability properties for time Petri nets
Cited in
(14)- Continuous reachability for unordered data Petri nets is in PTime
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
- Verification of Timed-Arc Petri Nets
- Forward analysis for WSTS, part I: completions
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
- Symbolic Reachability Analysis of Integer Timed Petri Nets
- Reachability analysis of (timed) Petri nets using real arithmetic
- ON THE CALCULATION OF THE TRANSFER FUNCTION OF TIMED EVENT PETRI NETS
- Beyond region graphs: Symbolic forward analysis of timed automata
- scientific article; zbMATH DE number 744061 (Why is no real title available?)
- Universal safety for timed Petri nets is PSPACE-complete
- A Clustering Approach to Approximate the Timed Reachability Graph for a Class of Time Petri Nets
- Dynamic networks of timed Petri nets
- Using forward reachability analysis for verification of timed Petri nets
This page was built for publication: Forward reachability analysis of timed Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464758)