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

DOI10.1007/3-540-45653-8_3zbMATH Open1275.68096OpenAlexW1528291435MaRDI QIDQ2996152FDOQ2996152

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

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

Mathematics Subject Classification ID

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

Cited In (11)

• From LTL to Symbolically Represented Deterministic Automata
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• More efficient on-the-fly LTL verification with Tarjan's algorithm
• Bounded model checking of infinite state systems

Uses Software

• Cadence SMV
• LTL2BA

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)