TAPAAL
From MaRDI portal
Software:13691
swMATH947MaRDI QIDQ13691FDOQ13691
Author name not available (Why is that?)
Cited In (19)
- Partial order reduction for reachability games
- Stubborn set reduction for timed reachability and safety games
- Strong behavioral similarities in timed-arc Petri nets
- Automatic synthesis of transiently correct network updates via Petri games
- Extended dependency graphs and efficient distributed fixed-point computation
- Simplification of CTL formulae for efficient model checking of Petri nets
- Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
- Stubborn versus structural reductions for Petri nets
- PeCAn: Compositional Verification of Petri Nets Made Easy
- Verification of Timed-Arc Petri Nets
- Automata-driven partial order reduction and guided search for LTL model checking
- Soundness of timed-arc workflow nets in discrete and continuous-time semantics
- Computing branching distances with quantitative games
- Model Checking Real-Time Systems
- Combining free choice and time in Petri nets
- Improvements in unfolding of colored Petri nets
- Soundness of Timed-Arc Workflow Nets
- PTrie: data structure for compressing and storing sets via prefix sharing
This page was built for software: TAPAAL