Model checking the full modal mu-calculus for infinite sequential processes
type: Item
instance of: scholarly article
title: Model checking the full modal mu-calculus for infinite sequential processes
zbMATH Open document ID: 0933.68063
DOI: 10.1016/S0304-3975(99)00034-1
author: Olaf Burkart
author: Bernhard Steffen
published in: Theoretical Computer Science
publication date: 2000-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1387428
zbMATH Keywords: infinite-state systems
zbMATH Keywords: context-free processes
zbMATH Keywords: pushdown processes
zbMATH Keywords: regular graphs
zbMATH Keywords: modal mu-calculus
zbMATH Keywords: model checking
MaRDI profile type: Publication
cites work: Q4222875
cites work: Q4222871
cites work: The modal mu-calculus alternation hierarchy is strict
cites work: Q4847017
cites work: Q4223065
cites work: Q4818835
cites work: Q4385531
cites work: Q4954445
cites work: Q4764629
cites work: On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
cites work: Results on the propositional \(\mu\)-calculus
cites work: An improved algorithm for the evaluation of fixpoint expressions
cites work: The theory of ends, pushdown automata, and second-order logic
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
description: scientific article; zbMATH DE number 1387428