Size-Change Termination and Satisfiability for Linear-Time Temporal Logics

DOI10.1007/978-3-642-24364-6_3zbMath1347.03034OpenAlexW152742108MaRDI QIDQ3172880

Martin Lange

Publication date: 7 October 2011

Published in: Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24364-6_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alternating finite automata on \(\omega\)-words
• Reasoning about infinite computations
• Temporal logic can be more expressive
• Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
• Efficient Büchi Universality Checking
• Büchi Complementation and Size-Change Termination
• The complexity of propositional linear temporal logics
• The size-change principle for program termination
• A Proof System for the Linear Time μ-Calculus
• Alternation Elimination by Complementation (Extended Abstract)

This page was built for publication: Size-Change Termination and Satisfiability for Linear-Time Temporal Logics