Three SCC-Based Emptiness Checks for Generalized Büchi Automata

DOI10.1007/978-3-642-45221-5_44zbMath1407.68301OpenAlexW9742571MaRDI QIDQ2870161

Etienne Renault, Fabrice Kordon, Denis Poitrenaud, Alexandre Duret-Lutz

Publication date: 17 January 2014

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45221-5_44

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Automated Verification of Parallel Nested DFS, Efficient approach of translating LTL formulae into Büchi automata, Degeneralization algorithm for generation of Büchi automata based on contented situation, A space-efficient algorithm for finding strongly connected components, Generic Emptiness Check for Fun and Profit, A weakness measure for GR(1) formulae, A weakness measure for GR(1) formulae