On-the-fly Emptiness Check of Transition-Based Streett Automata
From MaRDI portal
Publication:3648699
DOI10.1007/978-3-642-04761-9_17zbMath1262.68118MaRDI QIDQ3648699
Denis Poitrenaud, Alexandre Duret-Lutz, Jean-Michel Couvreur
Publication date: 1 December 2009
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04761-9_17
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modalities for model checking: Branching time logic strikes back
- The Büchi Complementation Saga
- Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
- Model Checking Software
- Automata-Theoretic Model Checking Revisited
- Depth-First Search and Linear Graph Algorithms
- Computer Aided Verification
- Verification by augmented abstraction: The automata-theoretic view