📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Polynomial-Time Under-Approximation of Winning Regions in Parity Games (2009)

First Author: Antonik A

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.1016/j.entcs.2008.12.070

Publication URI: https://api.elsevier.com/content/abstract/scopus_id/58149293202

Type: Journal Article/Review

Parent Publication: Electronic Notes in Theoretical Computer Science