scientific article
From MaRDI portal
Publication:3384164
zbMath1483.68198arXiv1708.04845MaRDI QIDQ3384164
Publication date: 14 December 2021
Full work available at URL: https://arxiv.org/abs/1708.04845
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Descriptive complexity and finite models (68Q19)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Results on the propositional \(\mu\)-calculus
- A finite model theorem for the propositional \(\mu\)-calculus
- Borel determinacy
- The modal mu-calculus alternation hierarchy is strict
- Monadic second-order logic on tree-like structures
- \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\)
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
- The Descriptive Complexity of Parity Games
- Automata for the modal μ-calculus and related results
- Deciding the topological complexity of Büchi languages *
- Fixpoint alternation: arithmetic, transition systems, and the binary tree
- Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction
- An automata-theoretic approach to branching-time model checking
This page was built for publication:
