Three notes on the complexity of model checking fixpoint logic with chop
From MaRDI portal
Publication:5441546
DOI10.1051/ita:2007011zbMath1133.68046OpenAlexW1987290139MaRDI QIDQ5441546
Publication date: 15 February 2008
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2007__41_2_177_0
Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)
Related Items (3)
Propositional dynamic logic of context-free programs and fixpoint logic with chop ⋮ Temporal Logic with Recursion. ⋮ Temporal logic with recursion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Programming languages and their definition. Selected papers ed. by C. B. Jones
- Results on the propositional \(\mu\)-calculus
- Tableau-based model checking in the propositional mu-calculus
- Fast and simple nested fixpoints
- An improved algorithm for the evaluation of fixpoint expressions
- Pushdown processes: Games and model-checking
- Automata, logics, and infinite games. A guide to current research
- Alternating Context-Free Languages and Linear Time μ-Calculus with Sequential Composition
- CONCUR 2004 - Concurrency Theory
- Mathematical Foundations of Computer Science 2005
- On model checking for the \(\mu\)-calculus and its fragments
This page was built for publication: Three notes on the complexity of model checking fixpoint logic with chop
