The Rabin index of parity games: Its complexity and approximation (2015)
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.ic.2015.06.005
Publication URI: http://www.sciencedirect.com/science/article/pii/S0890540115000723
Type: Journal Article/Review
Parent Publication: Information and Computation