A note on model checking the modal \(\nu\)-calculus

DOI10.1016/0304-3975(91)90043-2zbMath0745.68083OpenAlexW2012841134MaRDI QIDQ1176250

Glynn Winskel

Publication date: 25 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90043-2

zbMATH Keywords

model checkinglabelled transition systemmodelling parallel processes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (9)

Specification and verification for semi-structured data ⋮ Expressiveness and complexity of graph logic ⋮ Proving properties of dynamic process networks ⋮ Friends with Benefits ⋮ Canonical completeness of infinitary \(\mu \) ⋮ Preemptive type checking ⋮ A Note on Negative Tagging for Least Fixed-Point Formulae ⋮ On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions ⋮ A compositional \(\mu\)-calculus proof system for statecharts processes

Cites Work

• Results on the propositional \(\mu\)-calculus
• Automated analysis of mutual exclusion algorithms using CCS
• A lattice-theoretical fixpoint theorem and its applications
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on model checking the modal \(\nu\)-calculus