Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs
DOI10.1007/S10626-011-0100-4zbMATH Open1231.05255OpenAlexW1969752454MaRDI QIDQ539486FDOQ539486
Authors: H. Boucheneb, Kamel Barkaoui 
Publication date: 30 May 2011
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-011-0100-4
Recommendations
Applications of graph theory (05C90) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- TCTL model checking of time Petri nets
- Title not available (Why is that?)
- CTL* model checking for time Petri nets
- State space computation and analysis of Time Petri Nets
- Model Checking Bounded Prioritized Time Petri Nets
- A more efficient time Petri net state space abstraction useful to model checking timed linear properties
- Title not available (Why is that?)
- Applications and Theory of Petri Nets 2004
- On-the-fly \(TCTL\) model checking for time Petri nets
Cited In (4)
- Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs
- Time based deadlock prevention for Petri nets
- Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling
- A Clustering Approach to Approximate the Timed Reachability Graph for a Class of Time Petri Nets
This page was built for publication: Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q539486)
