{"date_published":"2012-10-07T00:00:00Z","publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1210.2450"}],"abstract":[{"lang":"eng","text":"The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a quantitative measure for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intu- itively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, and that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies."}],"type":"conference","day":"07","month":"10","date_updated":"2023-02-23T10:12:05Z","title":"Interface Simulation Distances","quality_controlled":"1","status":"public","related_material":{"record":[{"status":"public","id":"1733","relation":"later_version"}]},"oa_version":"Submitted Version","oa":1,"date_created":"2018-12-11T12:00:19Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"EPTCS","scopus_import":1,"conference":{"location":"Napoli, Italy","end_date":"2012-09-08","name":"GandALF: Games, Automata, Logic, and Formal Verification","start_date":"2012-09-06"},"citation":{"ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in <i>Electronic Proceedings in Theoretical Computer Science</i>, Napoli, Italy, 2012, vol. 96, pp. 29–42.","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” <i>Electronic Proceedings in Theoretical Computer Science</i>, vol. 96, EPTCS, 2012, pp. 29–42, doi:<a href=\"https://doi.org/10.4204/EPTCS.96.3\">10.4204/EPTCS.96.3</a>.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface Simulation Distances. In: <i>Electronic Proceedings in Theoretical Computer Science</i>. Vol 96. EPTCS; 2012:29-42. doi:<a href=\"https://doi.org/10.4204/EPTCS.96.3\">10.4204/EPTCS.96.3</a>","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games, Automata, Logic, and Formal Verification vol. 96, 29–42.","chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” In <i>Electronic Proceedings in Theoretical Computer Science</i>, 96:29–42. EPTCS, 2012. <a href=\"https://doi.org/10.4204/EPTCS.96.3\">https://doi.org/10.4204/EPTCS.96.3</a>.","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., &#38; Radhakrishna, A. (2012). Interface Simulation Distances. In <i>Electronic Proceedings in Theoretical Computer Science</i> (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.96.3\">https://doi.org/10.4204/EPTCS.96.3</a>"},"ec_funded":1,"_id":"2916","language":[{"iso":"eng"}],"author":[{"last_name":"Cerny","first_name":"Pavol","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Arjun","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"publication":"Electronic Proceedings in Theoretical Computer Science","page":"29 - 42","doi":"10.4204/EPTCS.96.3","external_id":{"arxiv":["1210.2450"]},"project":[{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"intvolume":"        96","publist_id":"3827","volume":96,"year":"2012"}