Efficient Büchi Universality Checking
From MaRDI portal
Publication:3557078
DOI10.1007/978-3-642-12002-2_17zbMath1258.68076OpenAlexW1550751956MaRDI QIDQ3557078
Publication date: 27 April 2010
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12002-2_17
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (11)
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata ⋮ Size-Change Termination and Satisfiability for Linear-Time Temporal Logics ⋮ Towards a grand unification of Büchi complementation constructions ⋮ Profile trees for Büchi word automata, with application to determinization ⋮ Fast offline partial evaluation of logic programs ⋮ Coinductive Algorithms for Büchi Automata ⋮ State of Büchi Complementation ⋮ Advanced Ramsey-Based Büchi Automata Inclusion Testing ⋮ Random Models for Evaluating Efficient Büchi Universality Checking ⋮ Domains for Higher-Order Games ⋮ Unnamed Item
This page was built for publication: Efficient Büchi Universality Checking
