Comparison of LTL to Deterministic Rabin Automata Translators

DOI10.1007/978-3-642-45221-5_12zbMath1406.68050OpenAlexW24632170MaRDI QIDQ2870123

Jan Strejček, František Blahoudek, Mojmír Křetínský

Publication date: 17 January 2014

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45221-5_12

Mathematics Subject Classification ID

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

Related Items

From LTL to deterministic automata. A safraless compositional approach, Model Checking Probabilistic Systems, Quantitative verification and strategy synthesis for stochastic games, From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata

Uses Software

• BEEM