Size-change termination and satisfiability for linear-time temporal logics
From MaRDI portal
Publication:3172880
Recommendations
Cites work
- scientific article; zbMATH DE number 1705164 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 1863182 (Why is no real title available?)
- scientific article; zbMATH DE number 1392300 (Why is no real title available?)
- A Proof System for the Linear Time μ-Calculus
- Alternating finite automata on \(\omega\)-words
- Alternation Elimination by Complementation (Extended Abstract)
- Büchi Complementation and Size-Change Termination
- Efficient Büchi universality checking
- Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
- Reasoning about infinite computations
- Temporal logic can be more expressive
- The complexity of propositional linear temporal logics
- The size-change principle for program termination
Cited in
(2)
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)