Solving parity games: explicit vs symbolic

DOI10.1007/978-3-319-94812-6_14OpenAlexW2810421936MaRDI QIDQ1616970

Aniello Murano, Antonio Di Stasio, Moshe Y. Vardi

Publication date: 7 November 2018

Full work available at URL: http://hdl.handle.net/11573/1400022

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Certifying inexpressibility ⋮ Improving parity games in practice

This page was built for publication: Solving parity games: explicit vs symbolic