The following pages link to TAPAAL (Q13691):
Displaying 19 items.
- Stubborn set reduction for timed reachability and safety games (Q832029) (← links)
- Stubborn versus structural reductions for Petri nets (Q1633343) (← links)
- Extended dependency graphs and efficient distributed fixed-point computation (Q1662534) (← links)
- PTrie: data structure for compressing and storing sets via prefix sharing (Q1675812) (← links)
- Automatic synthesis of transiently correct network updates via Petri games (Q2117163) (← links)
- Automata-driven partial order reduction and guided search for LTL model checking (Q2152647) (← links)
- Computing branching distances with quantitative games (Q2210522) (← links)
- Simplification of CTL formulae for efficient model checking of Petri nets (Q2280185) (← links)
- Combining free choice and time in Petri nets (Q2291812) (← links)
- Strong behavioral similarities in timed-arc Petri nets (Q2335136) (← links)
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata (Q2453531) (← links)
- Improvements in unfolding of colored Petri nets (Q2695488) (← links)
- Soundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics (Q2803579) (← links)
- Verification of Timed-Arc Petri Nets (Q3075507) (← links)
- Model Checking Real-Time Systems (Q3176387) (← links)
- PeCAn: Compositional Verification of Petri Nets Made Easy (Q3457799) (← links)
- Soundness of Timed-Arc Workflow Nets (Q5166756) (← links)
- Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets (Q5500572) (← links)
- Partial order reduction for reachability games (Q5875384) (← links)
