From LTL to unambiguous Büchi automata via disambiguation of alternating automata
From MaRDI portal
Publication:6535954
DOI10.1007/978-3-030-30942-8_17zbMATH Open1539.68168MaRDI QIDQ6535954
Could not fetch data.
Publication date: 14 March 2024
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata
- Alternating automata on infinite trees
- Unambiguous Büchi automata.
- Efficient minimization of deterministic weak \(\omega\)-automata
- Automata, logics, and infinite games. A guide to current research
- LTL to Büchi Automata Translation: Fast and More Deterministic
- Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Markov Chains and Unambiguous Büchi Automata
- Improved Upper and Lower Bounds for Büchi Disambiguation
- Manipulating LTL Formulas Using Spot 1.0
- LTL Model Checking of Interval Markov Chains
- Lazy probabilistic model checking without determinisation
- ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS
- Unambiguity in Automata Theory
This page was built for publication: From LTL to unambiguous Büchi automata via disambiguation of alternating automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535954)
