Solving Parity Games in Practice (Q3648698): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 06:22, 2 July 2024

scientific article

Language	Label	Description	Also known as
English	Solving Parity Games in Practice	scientific article

Statements

scholarly article

0 references

Solving Parity Games in Practice (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-04761-9_15

0 references

Oliver Friedmann

0 references

0 references

Automated Technology for Verification and Analysis

0 references

publication date

1 December 2009

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-04761-9_15

0 references

0 references

Polynomial-Time Under-Approximation of Winning Regions in Parity Games

0 references

Games for synthesis of controllers with partial observation.

0 references

Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)

0 references

0 references

A deterministic subexponential algorithm for solving parity games

0 references

Complementation, Disambiguation, and Determinization of Büchi Automata Unified

0 references

Solving Parity Games in Big Steps

0 references

An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games

0 references

Depth-First Search and Linear Graph Algorithms

0 references

A Multi-Core Solver for Parity Games

0 references

0 references

Infinite games on finitely coloured graphs with applications to automata on infinite trees

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3648698

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3648698&oldid=35140742"