article published yes Pavol Cerny author Martin Chmelik author 3624234E-F248-11E8-B48F-1D18A9856A87 Thomas A Henzinger author 40876CD8-F248-11E8-B48F-1D18A9856A870000−0002−2985−7724 Arjun Radhakrishna author 3B51CAC4-F248-11E8-B48F-1D18A9856A87 ToHe department KrCh department Quantitative Reactive Modeling project Moderne Concurrency Paradigms project Game Theory project Modern Graph Algorithmic Techniques in Formal Verification project Quantitative Graph Games: Theory and Applications project Microsoft Research Faculty Fellowship project The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, 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, that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces, and how to synthesize an interface from incompatible requirements. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies. Elsevier2014 eng 1210.2450 00034760130000910.1016/j.tcs.2014.08.019 5603348 - 363 https://research-explorer.ista.ac.at/record/2916 P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” <i>Theoretical Computer Science</i>, vol. 560, no. 3. Elsevier, pp. 348–363, 2014. Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363. Cerny, Pavol, et al. “Interface Simulation Distances.” <i>Theoretical Computer Science</i>, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:<a href="https://doi.org/10.1016/j.tcs.2014.08.019">10.1016/j.tcs.2014.08.019</a>. Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances. <i>Theoretical Computer Science</i>. 2014;560(3):348-363. doi:<a href="https://doi.org/10.1016/j.tcs.2014.08.019">10.1016/j.tcs.2014.08.019</a> P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363. Cerny, P., Chmelik, M., Henzinger, T. A., &#38; Radhakrishna, A. (2014). Interface simulation distances. <i>Theoretical Computer Science</i>. Elsevier. <a href="https://doi.org/10.1016/j.tcs.2014.08.019">https://doi.org/10.1016/j.tcs.2014.08.019</a> Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” <i>Theoretical Computer Science</i>. Elsevier, 2014. <a href="https://doi.org/10.1016/j.tcs.2014.08.019">https://doi.org/10.1016/j.tcs.2014.08.019</a>. 17332018-12-11T11:53:43Z2025-09-29T13:14:25Z