A linear-time model-checking algorithm for the alternation-free modal mu-calculus

DOI10.1007/3-540-55179-4_6MaRDI QIDQ6493517

Ranee Cleaveland, Bernhard Steffen

Publication date: 29 April 2024

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• A linear algorithm to solve fixed-point equations on transition systems
• Propositional dynamic logic of regular programs
• Compositional minimisation of finite state systems using interface specifications
• Testing equivalence as a bisimulation equivalence
• A lattice-theoretical fixpoint theorem and its applications
• Automatic verification of finite-state concurrent systems using temporal logic specifications

This page was built for publication: A linear-time model-checking algorithm for the alternation-free modal mu-calculus