THE COMPLEXITY OF COVERAGE

DOI10.1142/S0129054113400066zbMath1286.68310OpenAlexW2006735381MaRDI QIDQ2841992

Rupak Majumdar, Krishnendu Chatterjee, Luca de Alfaro

Publication date: 30 July 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054113400066

zbMATH Keywords

computational complexitycoverage problemgraph gamestimed and pushdown systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Multistage and repeated games (91A20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Unnamed Item

Cites Work

• The complexity of two-player games of incomplete information
• Pushdown processes: Games and model-checking
• Discrete-time control for rectangular hybrid automata
• Proof verification and the hardness of approximation problems
• The complexity of probabilistic verification