Random Models for Evaluating Efficient Büchi Universality Checking
From MaRDI portal
Publication:5224494
DOI10.1007/978-3-662-54069-5_8zbMath1483.68190OpenAlexW2557666292MaRDI QIDQ5224494
Seth Fogarty, Corey Fisher, Moshe Y. Vardi
Publication date: 24 July 2019
Published in: Logic and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-54069-5_8
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (1)
Uses Software
Cites Work
- The complementation problem for Büchi automata with applications to temporal logic
- Reasoning about infinite computations
- Turing-machines and the Entscheidungsproblem
- State of Büchi Complementation
- Advanced Ramsey-Based Büchi Automata Inclusion Testing
- The transitive closure of a random digraph
- Weak alternating automata are not that weak
- Efficient Büchi Universality Checking
- The Büchi Complementation Saga
- Büchi Complementation and Size-Change Termination
- Antichains for the Automata-Based Approach to Model-Checking
- Markov Graphs
- Random Models for Evaluating Efficient Büchi Universality Checking
- Experimental Evaluation of Classical Automata Constructions
- Antichains: A New Algorithm for Checking Universality of Finite Automata
This page was built for publication: Random Models for Evaluating Efficient Büchi Universality Checking
