Symbolic Implementation of Alternating Automata

DOI10.1007/11812128_20MaRDI QIDQ5757229zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Roderick Bloem, Alessandro Cimatti, Ingo Pill, Marco Roveri, S. Semprini

Publication date 6 September 2007

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11812128_20

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA
• Weak alternating automata are not that weak
• Alternation removal in Büchi automata
• Converting a Büchi alternating automaton to a usual nondeterministic one
• scientific article; zbMATH DE number 1775458

Cited in

(14)

• An explicit transition system construction approach to LTL satisfiability checking
• A symbolic decision procedure for symbolic alternating finite automata
• Extracting unsatisfiable cores for LTL via temporal resolution
• SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA
• Alternation removal in Büchi automata
• Towards a notion of unsatisfiable and unrealizable cores for LTL
• Synthesis of Reactive(1) designs
• Enhancing unsatisfiable cores for LTL with information on temporal relevance
• From LTL to Symbolically Represented Deterministic Automata
• Converting a Büchi alternating automaton to a usual nondeterministic one
• Simplifying Alternating Automata for Emptiness Testing
• Practical applications of the alternating cycle decomposition
• Variable and clause elimination for LTL satisfiability checking
• HRELTL: a temporal logic for hybrid systems

This page was built for publication: Symbolic Implementation of Alternating Automata

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