--- _id: '3878' abstract: - lang: eng text: We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between the tester and the system, where the system state space is partitioned according to some coverage criterion and the objective of the tester is to maximize the set of partitions (or coverage goals) visited during the game. We show the complexity of the maximal coverage problem for non-deterministic systems is PSPACE-complete, but is NP-complete for deterministic systems. For the special case of non-deterministic systems with a re-initializing “reset” action, which represent running a new test input on a re-initialized system, we show that the complexity is coNP-complete. Our proof technique for reset games uses randomized testing strategies that circumvent the exponentially large memory requirement of deterministic testing strategies. acknowledgement: This research was supported in part by the NSF grants CCR-0132780 and CNS-0720884. alternative_title: - LNCS author: - first_name: Krishnendu full_name: Krishnendu Chatterjee id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Luca full_name: de Alfaro, Luca last_name: De Alfaro - first_name: Ritankar full_name: Majumdar, Ritankar S last_name: Majumdar citation: ama: 'Chatterjee K, De Alfaro L, Majumdar R. The complexity of coverage. In: Vol 5356. Springer; 2008:91-106. doi:10.1007/978-3-540-89330-1_7' apa: 'Chatterjee, K., De Alfaro, L., & Majumdar, R. (2008). The complexity of coverage (Vol. 5356, pp. 91–106). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Springer. https://doi.org/10.1007/978-3-540-89330-1_7' chicago: Chatterjee, Krishnendu, Luca De Alfaro, and Ritankar Majumdar. “The Complexity of Coverage,” 5356:91–106. Springer, 2008. https://doi.org/10.1007/978-3-540-89330-1_7. ieee: 'K. Chatterjee, L. De Alfaro, and R. Majumdar, “The complexity of coverage,” presented at the APLAS: Asian Symposium on Programming Languages and Systems, 2008, vol. 5356, pp. 91–106.' ista: 'Chatterjee K, De Alfaro L, Majumdar R. 2008. The complexity of coverage. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 5356, 91–106.' mla: Chatterjee, Krishnendu, et al. The Complexity of Coverage. Vol. 5356, Springer, 2008, pp. 91–106, doi:10.1007/978-3-540-89330-1_7. short: K. Chatterjee, L. De Alfaro, R. Majumdar, in:, Springer, 2008, pp. 91–106. conference: name: 'APLAS: Asian Symposium on Programming Languages and Systems' date_created: 2018-12-11T12:05:40Z date_published: 2008-12-03T00:00:00Z date_updated: 2021-01-12T07:52:53Z day: '03' doi: 10.1007/978-3-540-89330-1_7 extern: 1 intvolume: ' 5356' main_file_link: - open_access: '1' url: http://arxiv.org/abs/0804.4525 month: '12' oa: 1 page: 91 - 106 publication_status: published publisher: Springer publist_id: '2292' quality_controlled: 0 status: public title: The complexity of coverage type: conference volume: 5356 year: '2008' ...