Partial Solvers for Parity Games: Effective Polynomial-Time Composition (2016)
Attributed to:
Complete and Efficient Checks for Branching-Time Abstractions
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1609.04085
Publication URI: https://arxiv.org/abs/1609.04085
Type: Journal Article/Review
Parent Publication: arXiv e-prints