Random models for evaluating efficient Büchi universality checking

DOI10.1007/978-3-662-54069-5_8MaRDI QIDQ5224494zbMATH OpenOpenAlexFDO

Authors Corey Fisher, Seth Fogarty, 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

Mathematics Subject Classification ID

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

Recommendations

• Improved Algorithms for the Automata-Based Approach to Model-Checking
• Antichains for the Automata-Based Approach to Model-Checking
• Efficient Büchi universality checking
• Automata-Theoretic Model Checking Revisited
• scientific article; zbMATH DE number 1670552

Cites work

• Advanced Ramsey-based Büchi automata inclusion testing
• Antichains for the Automata-Based Approach to Model-Checking
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Büchi Complementation and Size-Change Termination
• Efficient Büchi universality checking
• Experimental Evaluation of Classical Automata Constructions
• Markov Graphs
• Random models for evaluating efficient Büchi universality checking
• Reasoning about infinite computations
• State of Büchi complementation
• The Büchi Complementation Saga
• The complementation problem for Büchi automata with applications to temporal logic
• The transitive closure of a random digraph
• Turing-machines and the Entscheidungsproblem
• Weak alternating automata are not that weak

Cited in

(1)

• Random models for evaluating efficient Büchi universality checking

Describes a project that uses

Uses Software

• Antichains

This page was built for publication: Random models for evaluating efficient Büchi universality checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224494)