Quasipolynomial Set-Based Symbolic Algorithms for Parity Games
Work
Year: 2018
Type: article
Abstract: Solving parity games, which are equivalent to modal $\mu$-calculus model checking, is a central algorithmic problem in formal methods. Besides the standard computation model with the explicit represen... more
Source: EPiC series in computing
Cites: 54
Cited by: 10
Related to: 10
FWCI: 1.037
Citation percentile (by year/subfield): 66.93
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze