Mu-calculus path checking
type: Item
instance of: scholarly article
title: Mu-calculus path checking
zbMATH Open document ID: 1184.68339
author: Nicolas Markey
author: Philippe Schnoebelen
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 5650202
zbMATH Keywords: program correctness
zbMATH Keywords: formal methods
zbMATH Keywords: mu-calculus
zbMATH Keywords: model checking
describes a project that uses: APMC
describes a project that uses: JPAX
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.11.010
OpenAlex ID: W2063071438
cites work: Combining test case generation and runtime verification
cites work: The modal mu-calculus alternation hierarchy is strict
cites work: Modal logics and mu-calculi: An introduction
cites work: The complexity of propositional linear temporal logics in simple cases
cites work: An overview of the runtime verification tool Java PathExplorer
cites work: Verification, Model Checking, and Abstract Interpretation
cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
cites work: CONCUR 2003 - Concurrency Theory
cites work: Q4472245
cites work: Q3730012
cites work: Q4219045
DOI: 10.1016/J.IPL.2005.11.010
description: scientific article; zbMATH DE number 5650202