TAPAAL
From MaRDI portal
Cited in
(39)- Repeatability package
- Combining free choice and time in Petri nets
- Soundness of timed-arc workflow nets
- Stubborn versus structural reductions for Petri nets
- Stubborn set reduction for timed reachability and safety games
- Automatic synthesis of transiently correct network updates via Petri games
- Model Checking Real-Time Systems
- PeCAn: compositional verification of Petri nets made easy
- Automata-driven partial order reduction and guided search for LTL model checking
- Partial order reduction for reachability games
- PTrie: data structure for compressing and storing sets via prefix sharing
- Romeo
- CPN/Tools
- Access/CPN
- IF-2.0
- TINA
- GEZEL
- LoLA
- PetriNets
- SNOOPY
- Verics
- CMC
- MARCIE
- Soundness of timed-arc workflow nets in discrete and continuous-time semantics
- Computing branching distances with quantitative games
- UPPAAL CORA
- ITS-Tools
- PeCAn
- AdamMC
- zUpdate
- Extended dependency graphs and efficient distributed fixed-point computation
- Simplification of CTL formulae for efficient model checking of Petri nets
- PTrie
- Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets
- ADG
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
- Verification of Timed-Arc Petri Nets
- Strong behavioral similarities in timed-arc Petri nets
- Improvements in unfolding of colored Petri nets
This page was built for software: TAPAAL
