Satisfiability of Linear Time Mu-Calculus on Finite Traces

DOI10.1007/978-3-319-42634-1_49zbMath1476.68178OpenAlexW2496226321MaRDI QIDQ2817904

Cong Tian, Bin Cui, Yao Liu, Zhenhua Duan

Publication date: 2 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-42634-1_49

zbMATH Keywords

satisfiabilitydecision procedurefinite traceslinear-time \(\mu \)-calculuspresent-future form graph

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A practical decision procedure for propositional projection temporal logic with infinite models
• Results on the propositional \(\mu\)-calculus
• Propositional dynamic logic of regular programs
• Planning for temporally extended goals.
• A decision procedure for propositional projection temporal logic with infinite models
• A Proof System for the Linear Time μ-Calculus

This page was built for publication: Satisfiability of Linear Time Mu-Calculus on Finite Traces