A survey on satisfiability checking for the \(\mu \)-calculus through tree automata
From MaRDI portal
Publication:6113978
DOI10.1007/978-3-031-22337-2_11zbMath1528.68185arXiv2207.00517OpenAlexW4312350277MaRDI QIDQ6113978
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.00517
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Unnamed Item
- Unnamed Item
- Alternating finite automata on \(\omega\)-words
- Results on the propositional \(\mu\)-calculus
- Alternating automata on infinite trees
- An automata theoretic decision procedure for the propositional mu- calculus
- Universal graphs and good for games automata: new tools for infinite duration games
- Permutation games for the weakly aconjunctive \(\mu \)-calculus
- Satisfiability Games for Branching-Time Logics
- Determinising Parity Automata
- From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
- Solving Games Without Determinization
- Tighter Bounds for the Determinisation of Büchi Automata
- The Complexity of Tree Automata and Logics of Programs
- Deciding the unguarded modal -calculus
- Deciding parity games in quasipolynomial time
- Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
This page was built for publication: A survey on satisfiability checking for the \(\mu \)-calculus through tree automata
