How to Translate Efficiently Extensions of Temporal Logics into Alternating Automata

DOI10.1007/978-3-642-32943-2_3zbMath1362.03020OpenAlexW2103874098MaRDI QIDQ2915098

Julian Samborski-Forlese, César Sánchez

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

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (2)

Compositional Specification in Rewriting Logic ⋮ Visibly linear temporal logic

This page was built for publication: How to Translate Efficiently Extensions of Temporal Logics into Alternating Automata