Games for the \(\mu\)-calculus
type: Item
instance of: scholarly article
title: Games for the \(\mu\)-calculus
zbMATH Open document ID: 0872.03017
DOI: 10.1016/0304-3975(95)00136-0
author: Igor Walukiewicz
author: Damian Niwiński
published in: Theoretical Computer Science
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 983251
zbMATH Keywords: propositional \(\mu\)-calculus
zbMATH Keywords: model of a formula
zbMATH Keywords: relation of a formula
zbMATH Keywords: Martin's determinacy theorem
zbMATH Keywords: regular trees
zbMATH Keywords: model theorem for the \(\mu\)-calculus
zbMATH Keywords: testifying incorrectness of a program specification
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00136-0
OpenAlex ID: W2467982476
cites work: CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
cites work: Q3906386
cites work: On model checking for the \(\mu\)-calculus and its fragments
cites work: Q3203012
cites work: Propositional dynamic logic of regular programs
cites work: Results on the propositional \(\mu\)-calculus
cites work: An elementary proof of the completeness of PDL
cites work: Borel determinacy
cites work: Q5322161
cites work: Modal logics for communicating systems
cites work: Local model checking in the modal mu-calculus
cites work: An automata theoretic decision procedure for the propositional mu- calculus
description: scientific article; zbMATH DE number 983251