Antichains: A New Algorithm for Checking Universality of Finite Automata

DOI10.1007/11817963_5zbMath1188.68171MaRDI QIDQ5756729

Thomas A. Henzinger, Jean-François Raskin, Laurent Doyen, Martin De Wulf

Publication date: 5 September 2007

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11817963_5

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Automata Learning: A Categorical Perspective, Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking, Antichains and compositional algorithms for LTL synthesis, Verification of STM on relaxed memory models, Strategy construction for parity games with imperfect information, Fixed point guided abstraction refinement for alternating automata, Parametric random generation of deterministic tree automata, Strategy synthesis for multi-dimensional quantitative objectives, Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm, Model checking transactional memories, Advanced Ramsey-Based Büchi Automata Inclusion Testing, Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic, Completeness and Nondeterminism in Model Checking Transactional Memories, Strategy Construction for Parity Games with Imperfect Information, Transactional Reduction of Component Compositions, Computing Weakest Strategies for Safety Games of Imperfect Information, Random Generation of Deterministic Tree (Walking) Automata, Fixpoint Guided Abstraction Refinement for Alternating Automata

Uses Software

• CUDD
• Antichains