Time and Parallelizability Results for Parity Games with Bounded Treewidth
Attributed to:
Synthesis and Verification in Markov Game Structures
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-31585-5_20
Publication URI: http://www.springerlink.com/content/0302-9743/
Type: Book Chapter
Book Title: Automata, Languages, and Programming (2012)
Page Reference: 189-200