TAPAAL 2.0: integrated development environment for timed-arc Petri nets
From MaRDI portal
Publication:2894293
Recommendations
- Verification of Timed-Arc Petri Nets
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
- scientific article; zbMATH DE number 2088674
- Structural translation from time Petri nets to timed automata
- Model checking time-dependent system specifications using time stream Petri nets and \texttt{UPPAAL}
Cited in
(18)- Soundness of timed-arc workflow nets
- Stubborn versus structural reductions for Petri nets
- Kaki: efficient concurrent update synthesis for SDN
- Stubborn set reduction for timed reachability and safety games
- Automatic synthesis of transiently correct network updates via Petri games
- Tools and Algorithms for the Construction and Analysis of Systems
- Automata-driven partial order reduction and guided search for LTL model checking
- Partial order reduction for reachability games
- Taking Some Burden Off an Explicit CTL Model Checker
- TAPAAL
- Property directed reachability for generalized Petri nets
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
- Strong behavioral similarities in timed-arc Petri nets
- Improvements in unfolding of colored Petri nets
- LTL under reductions with weaker conditions than stutter invariance
- Kaki: concurrent update synthesis for regular policies via Petri games
- Elimination of detached regions in dependency graph verification
- Methods for Efficient Unfolding of Colored Petri Nets
This page was built for publication: TAPAAL 2.0: integrated development environment for timed-arc Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894293)