Cited in
(40)- Reachability problems and abstract state spaces for time Petri nets with stopwatches
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
- Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper)
- Timed CTL model checking in Real-Time Maude
- Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization
- TCTL model checking of time Petri nets
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
- A concurrency-preserving translation from time Petri nets to networks of timed automata
- Formal Modeling and Analysis of Timed Systems
- Formalising concurrent UML state machines using coloured Petri nets
- Formal verification of real-time systems with preemptive scheduling
- Verification of Timed-Arc Petri Nets
- TAPAAL
- Kronos
- IF-2.0
- TINA
- GEZEL
- PetriNets
- Oris
- Verics
- CMC
- SynchAADL2Maude
- TSMV
- NewPolka
- Papyrus
- MARTE
- UPPAAL CORA
- Towards building the state class graph of the TSPN model
- When are timed automata weakly timed bisimilar to time Petri nets?
- Computing branching distances with quantitative games
- Model Checking Real-Time Systems
- Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
- Diagnosis Using Unfoldings of Parametric Time Petri Nets
- SAT-based (parametric) reachability for a class of distributed time Petri nets
- Automating the transformation-based analysis of visual languages
- Symbolic unfolding of parametric stopwatch Petri nets
- Shrinking of time Petri nets
- TAPAAL 2.0: integrated development environment for timed-arc Petri nets
- Timed aggregate graph: a finite graph preserving event- and state-based quantitative properties of time Petri nets
- Symbolic Unfoldings for Networks of Timed Automata
This page was built for software: Romeo
