Fixed point guided abstraction refinement for alternating automata

DOI10.1016/j.tcs.2010.05.037zbMath1207.68186OpenAlexW2005690043MaRDI QIDQ1959653

Pierre Ganty, Nicolas Maquet, Jean-François Raskin

Publication date: 7 October 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.037

zbMATH Keywords

antichainsabstract interpretationalternating automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• Antichains

Cites Work

• Counterexample-guided abstraction refinement for symbolic model checking
• Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
• Fixpoint-Guided Abstraction Refinements
• Büchi Complementation and Size-Change Termination
• Alternation
• Algorithms for Omega-Regular Games with Imperfect Information
• Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Improved Algorithms for the Automata-Based Approach to Model-Checking
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fixed point guided abstraction refinement for alternating automata