Reachability problems and abstract state spaces for time Petri nets with stopwatches
From MaRDI portal
Publication:884758
DOI10.1007/S10626-006-0011-YzbMATH Open1134.93369OpenAlexW2021391928MaRDI QIDQ884758FDOQ884758
Bernard Berthomieu, Olivier H. Roux, Didier Lime, François Vernadat
Publication date: 7 June 2007
Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10626-006-0011-y
ApproximationDecidabilityReachabilityReal-time systems modeling and verificationState classesStopwatchesTime Petri Nets
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Aided Verification
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- The algorithmic analysis of hybrid systems
- Complexity of some problems in Petri nets
- The tool TINA – Construction of abstract state spaces for petri nets and time petri nets
- CTL* model checking for time Petri nets
- Applications and Theory of Petri Nets 2004
Cited In (18)
- Expressiveness of Petri Nets with Stopwatches. Dense-time Part
- Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper)
- Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph
- Time distance-based computation of the \textit{DBM} over-approximation of preemptive real-time systems
- Spatial determinism for a free \(\mathbb Z^2\)-action
- Interpreted synchronous extension of time Petri nets. Definition, semantics and formal analysis
- Applications and Theory of Petri Nets 2004
- Formal verification of real-time systems with preemptive scheduling
- Waiting Nets: State Classes and Taxonomy
- Post and pre-initialized stopwatch Petri nets: formal semantics and state space computation
- Zero entropy systems
- Waiting nets
- Growth-type invariants for \(\mathbb Z^{d}\) subshifts of finite type and arithmetical classes of real numbers
- A game approach to the parametric control of real-time systems
- Topological pressure dimension for almost additive potentials
- “Metric” complexity for weakly chaotic systems
- Symbolic unfolding of parametric stopwatch Petri nets
- Shrinking of time Petri nets
Uses Software
This page was built for publication: Reachability problems and abstract state spaces for time Petri nets with stopwatches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884758)
