Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus
From MaRDI portal
Publication:2946334
DOI10.1007/978-3-662-48057-1_14zbMath1465.68173OpenAlexW2138793937MaRDI QIDQ2946334
Catalin Dima, Sophie Pinchinat, Bastien Maubert
Publication date: 16 September 2015
Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48057-1_14
Applications of game theory (91A80) Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Higher-order logic (03B16)
Related Items (2)
Cites Work
- Primitive digraphs with large exponents and slowly synchronizing automata
- Model-checking games for logics of imperfect information
- Information tracking in games on graphs
- Infinite trees and automaton-definable relations over \(\omega\)-words
- Monadic second-order logic on tree-like structures
- On infinite transition graphs having a decidable monadic theory
- Strategy construction for parity games with imperfect information
- The monadic quantifier alternation hierarchy over grids and graphs
- Jumping Automata for Uniform Strategies
- Asynchronous Omega-Regular Games with Partial Information
- Distributed Graph Automata
- Complete Axiomatizations for Reasoning about Knowledge and Time
- The Complexity of Partial-Observation Parity Games
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
- Model Checking on Trees with Path Equivalences
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus
