LTL to self-loop alternating automata with generic acceptance and back
From MaRDI portal
Publication:2202003
DOI10.1016/J.TCS.2020.07.015zbMATH Open1460.68049OpenAlexW3044150573MaRDI QIDQ2202003FDOQ2202003
Juraj Major, Jan Strejček, František Blahoudek
Publication date: 17 September 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.07.015
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) 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?)
- LTL to Büchi Automata Translation: Fast and More Deterministic
- Manipulating LTL Formulas Using Spot 1.0
- Modalities for model checking: Branching time logic strikes back
- Model Checking Software
- Model Checking Software
- Tools and Algorithms for the Construction and Analysis of Systems
- Owl: a library for \(\omega \)-words, automata, and LTL
- Implementation and Application of Automata
- LTL to smaller self-loop alternating automata and back
- Generic Emptiness Check for Fun and Profit
- Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment
- Parallel Explicit Model Checking for Generalized Büchi Automata
Cited In (3)
Uses Software
This page was built for publication: LTL to self-loop alternating automata with generic acceptance and back
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202003)
