Improving automata generation for linear temporal logic by considering the automaton hierarchy

DOI10.1007/3-540-45653-8_3MaRDI QIDQ2996152zbMATH OpenOpenAlexFDO

Authors Klaus Schneider

Publication date 6 May 2011

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

Full work available at URL https://doi.org/10.1007/3-540-45653-8_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Recommendations

• scientific article; zbMATH DE number 2102710
• scientific article; zbMATH DE number 1487868
• scientific article; zbMATH DE number 1670781
• How to translate efficiently extensions of temporal logics into alternating automata
• scientific article; zbMATH DE number 1973991

Cited in

(11)

• From LTL to Symbolically Represented Deterministic Automata
• scientific article; zbMATH DE number 1424021 (Why is no real title available?)
• How to translate efficiently extensions of temporal logics into alternating automata
• Assumption-based runtime verification
• Implementation and Application of Automata
• Tool support for learning Büchi automata and linear temporal logic
• Graph Games and Reactive Synthesis
• scientific article; zbMATH DE number 6423748 (Why is no real title available?)
• scientific article; zbMATH DE number 2102710 (Why is no real title available?)
• More efficient on-the-fly LTL verification with Tarjan's algorithm
• Bounded model checking of infinite state systems

Describes a project that uses

Uses Software

• LTL2BA
• Cadence SMV

This page was built for publication: Improving automata generation for linear temporal logic by considering the automaton hierarchy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996152)