Symbolic Implementation of Alternating Automata

DOI10.1007/11812128_20zbMath1160.68401OpenAlexW1755580915WikidataQ62041365 ScholiaQ62041365MaRDI QIDQ5757229

Ingo Pill, Marco Roveri, Alessandro Cimatti, Roderick Bloem, 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)

Related Items (8)

Extracting unsatisfiable cores for LTL via temporal resolution ⋮ HRELTL: a temporal logic for hybrid systems ⋮ Towards a notion of unsatisfiable and unrealizable cores for LTL ⋮ Synthesis of Reactive(1) designs ⋮ An explicit transition system construction approach to LTL satisfiability checking ⋮ Enhancing unsatisfiable cores for LTL with information on temporal relevance ⋮ From LTL to Symbolically Represented Deterministic Automata ⋮ Variable and clause elimination for LTL satisfiability checking

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