TWO LOCAL STRATEGY ITERATION SCHEMES FOR PARITY GAME SOLVING (Q2909223): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Games for synthesis of controllers with partial observation. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Model Checking Games for Branching Time Logics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank | |||
Normal rank | |||
Revision as of 14:26, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | TWO LOCAL STRATEGY ITERATION SCHEMES FOR PARITY GAME SOLVING |
scientific article |
Statements
TWO LOCAL STRATEGY ITERATION SCHEMES FOR PARITY GAME SOLVING (English)
0 references
30 August 2012
0 references
parity games
0 references
strategy iteration
0 references
local solving
0 references
modal \(\mu \) calculus
0 references
