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

DOI10.1007/978-3-642-24364-6_3zbMATH Open1347.03034OpenAlexW152742108MaRDI QIDQ3172880FDOQ3172880

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

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

Cited In (2)

• Size-Change Abstraction and Max-Plus Automata
• Size-estimation framework with applications to transitive closure and reachability

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

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