{"date_created":"2018-12-11T11:59:44Z","month":"02","citation":{"ieee":"K. Chatterjee, L. Alfaro, and R. Majumdar, “The complexity of coverage,” <i>International Journal of Foundations of Computer Science</i>, vol. 24, no. 2. World Scientific Publishing, pp. 165–185, 2013.","ama":"Chatterjee K, Alfaro L, Majumdar R. The complexity of coverage. <i>International Journal of Foundations of Computer Science</i>. 2013;24(2):165-185. doi:<a href=\"https://doi.org/10.1142/S0129054113400066\">10.1142/S0129054113400066</a>","mla":"Chatterjee, Krishnendu, et al. “The Complexity of Coverage.” <i>International Journal of Foundations of Computer Science</i>, vol. 24, no. 2, World Scientific Publishing, 2013, pp. 165–85, doi:<a href=\"https://doi.org/10.1142/S0129054113400066\">10.1142/S0129054113400066</a>.","short":"K. Chatterjee, L. Alfaro, R. Majumdar, International Journal of Foundations of Computer Science 24 (2013) 165–185.","apa":"Chatterjee, K., Alfaro, L., &#38; Majumdar, R. (2013). The complexity of coverage. <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129054113400066\">https://doi.org/10.1142/S0129054113400066</a>","chicago":"Chatterjee, Krishnendu, Luca Alfaro, and Ritankar Majumdar. “The Complexity of Coverage.” <i>International Journal of Foundations of Computer Science</i>. World Scientific Publishing, 2013. <a href=\"https://doi.org/10.1142/S0129054113400066\">https://doi.org/10.1142/S0129054113400066</a>.","ista":"Chatterjee K, Alfaro L, Majumdar R. 2013. The complexity of coverage. International Journal of Foundations of Computer Science. 24(2), 165–185."},"department":[{"_id":"KrCh"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["0804.4525"]},"page":"165 - 185","status":"public","project":[{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"type":"journal_article","volume":24,"date_updated":"2021-01-12T06:59:54Z","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 &quot;reset&quot; 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. We also discuss the memory requirement for deterministic strategies and extensions of our results to other models, such as pushdown systems and timed systems."}],"publication_status":"published","publication":"International Journal of Foundations of Computer Science","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Alfaro","first_name":"Luca","full_name":"Alfaro, Luca"},{"first_name":"Ritankar","full_name":"Majumdar, Ritankar","last_name":"Majumdar"}],"doi":"10.1142/S0129054113400066","_id":"2814","date_published":"2013-02-01T00:00:00Z","day":"01","ec_funded":1,"year":"2013","publisher":"World Scientific Publishing","language":[{"iso":"eng"}],"intvolume":"        24","publist_id":"4070","oa_version":"Preprint","issue":"2","title":"The complexity of coverage","quality_controlled":"1","scopus_import":1,"main_file_link":[{"url":"https://arxiv.org/abs/0804.4525","open_access":"1"}]}