How to translate efficiently extensions of temporal logics into alternating automata
DOI10.1007/978-3-642-32943-2_3zbMATH Open1362.03020OpenAlexW2103874098MaRDI QIDQ2915098FDOQ2915098
Authors: César Sánchez, Julian Samborski-Forlese 
Publication date: 21 September 2012
Published in: Theoretical Aspects of Computing – ICTAC 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32943-2_3
Recommendations
- Improving automata generation for linear temporal logic by considering the automaton hierarchy
- Effective translation of LTL to deterministic Rabin automata: beyond the \((\mathrm F,\mathrm G)\)-fragment
- A Unified Translation of Linear Temporal Logic to ω-Automata
- An automata-theoretic approach to branching-time model checking
- scientific article; zbMATH DE number 6401143
Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cited In (9)
- Visibly linear temporal logic
- Title not available (Why is that?)
- Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs
- Implementation and Application of Automata
- Automated Deduction – CADE-19
- Alternating automata and temporal logic normal forms
- Improving the translation from ECTL to SAT
- Improving automata generation for linear temporal logic by considering the automaton hierarchy
- Compositional specification in rewriting logic
This page was built for publication: How to translate efficiently extensions of temporal logics into alternating automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915098)
