scientific article

zbMath1270.91017MaRDI QIDQ2842876

Thierry Cachat

Publication date: 16 August 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066104805346

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Solving Infinite Games in the Baire Space ⋮ Efficient CTL model-checking for pushdown systems ⋮ On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) ⋮ Reachability on prefix-recognizable graphs ⋮ Games on Multi-stack Pushdown Systems ⋮ On Global Model Checking Trees Generated by Higher-Order Recursion Schemes ⋮ Note on winning positions on pushdown games with \(\omega\)-regular conditions ⋮ Efficient CTL Model-Checking for Pushdown Systems ⋮ Games on Higher Order Multi-stack Pushdown Systems ⋮ Games with winning conditions of high Borel complexity

Cites Work

• On model checking for the \(\mu\)-calculus and its fragments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: