Uniform solution of parity games on prefix-recognizable graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1670767 (Why is no real title available?)
- scientific article; zbMATH DE number 1670778 (Why is no real title available?)
- scientific article; zbMATH DE number 1223729 (Why is no real title available?)
- scientific article; zbMATH DE number 1738661 (Why is no real title available?)
- scientific article; zbMATH DE number 2086664 (Why is no real title available?)
- scientific article; zbMATH DE number 2102748 (Why is no real title available?)
- On model checking for the -calculus and its fragments
Cited in
(11)- Note on winning positions on pushdown games with \(\omega\)-regular conditions
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
- Efficient CTL model-checking for pushdown systems
- Games on Multi-stack Pushdown Systems
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
- Games on Higher Order Multi-stack Pushdown Systems
- Efficient CTL model-checking for pushdown systems
- Solving Infinite Games in the Baire Space
- Formats of winning strategies for six types of pushdown games
- Games with winning conditions of high Borel complexity
- Reachability on prefix-recognizable graphs
This page was built for publication: Uniform solution of parity games on prefix-recognizable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842876)
