Mu-calculus path checking

DOI10.1016/J.IPL.2005.11.010zbMath1184.68339OpenAlexW2063071438MaRDI QIDQ1045942

Nicolas Markey, Philippe Schnoebelen

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.11.010

zbMATH Keywords

model checkingformal methodsmu-calculusprogram correctness

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Weak Kripke Structures and LTL

Uses Software

• JPAX
• APMC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Combining test case generation and runtime verification
• The modal mu-calculus alternation hierarchy is strict
• The complexity of propositional linear temporal logics in simple cases
• An overview of the runtime verification tool Java PathExplorer
• CONCUR 2003 - Concurrency Theory
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Mu-calculus path checking