Symbolic unfolding of parametric stopwatch Petri nets
From MaRDI portal
Publication:2248088
DOI10.1007/s10703-013-0188-2zbMath1291.68289MaRDI QIDQ2248088
Claude Jard, Louis-Marie Traonouez, Olivier H. Roux, Didier Lime
Publication date: 30 June 2014
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-013-0188-2
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Formal verification of real-time systems with preemptive scheduling
- Model checking of time Petri nets using the state class timed automaton
- Reachability problems and abstract state spaces for time Petri nets with stopwatches
- What's decidable about hybrid automata?
- Model checking using net unfoldings
- A causal semantic for time Petri nets
- An improvement of McMillan's unfolding algorithm
- Distributed monitoring of concurrent and asynchronous systems
- On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
- Unfoldings: A partial-order approach to model checking.
- Timed Unfoldings for Networks of Timed Automata
- Symbolic Unfoldings for Networks of Timed Automata
- Diagnosis Using Unfoldings of Parametric Time Petri Nets
- Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
- Symbolic Unfolding of Parametric Stopwatch Petri Nets
- State space computation and analysis of Time Petri Nets
