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

DOI10.1007/3-540-55179-4_6MaRDI QIDQ6493517zbMATH OpenFDO

Authors Ranee Cleaveland, Bernhard Steffen

Publication date 29 April 2024

Full work available at URL https://doi.org/10.1007/3-540-55179-4_6

Mathematics Subject Classification ID

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

Cites work

• A lattice-theoretical fixpoint theorem and its applications
• A linear algorithm to solve fixed-point equations on transition systems
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Compositional minimisation of finite state systems using interface specifications
• scientific article; zbMATH DE number 4056971 (Why is no real title available?)
• scientific article; zbMATH DE number 176729 (Why is no real title available?)
• Propositional dynamic logic of regular programs
• Results on the propositional \(\mu\)-calculus
• Testing equivalence as a bisimulation equivalence

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

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