scientific article; zbMATH DE number 6790163

DOI10.23638/LMCS-13(3:26)2017zbMath1459.68117arXiv1410.0833MaRDI QIDQ5367065

Krishnendu Chatterjee, Veronika Loitzenbauer, Monika R. Henzinger

Publication date: 12 October 2017

Full work available at URL: https://arxiv.org/abs/1410.0833

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

synthesisparity gamesgraph algorithmsgraph gamescomputer-aided verificationStreett automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Fine-grained complexity lower bounds for problems in computer aided verification ⋮ Unnamed Item ⋮ Generic Emptiness Check for Fun and Profit

This page was built for publication: