A note on model checking the modal \(\nu\)-calculus
From MaRDI portal
Publication:1176250
DOI10.1016/0304-3975(91)90043-2zbMath0745.68083MaRDI QIDQ1176250
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
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
A Note on Negative Tagging for Least Fixed-Point Formulae, Specification and verification for semi-structured data, Expressiveness and complexity of graph logic, Canonical completeness of infinitary \(\mu \), A compositional \(\mu\)-calculus proof system for statecharts processes, Proving properties of dynamic process networks
Cites Work