- Branching-Time Model-Checking of Probabilistic Pushdown Automata
Tomas Brazdil, Vaclav Brozek and Vojtech Forejt
- On Decidability of LTL+Past Model Checking for Process Rewrite Systems
Mojmir Kretinsky, Vojtech Rehak and Jan Strejcek
- Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives
Yohan Boichut, Pierre-Cyrille Heam and Olga Kouchnarenko
- Automatic verification of counter systems with ranking function
Emmanuelle Encrenaz and Alain Finkel
- Efficient reachability graph representation of Petri nets with unbounded counters
Franck Pommereau, Raymond Devillers and Hanna Klaudel
|