2012/10/09 by Pavol Černý, Martin Chmelík, Thomas A. Henzinger +1
Computer Science · #cs.SE #cs.LO
paper · pdf · doi:10.4204/eptcs.96.3
published as EPTCS 96, 2012, pp. 29-42 · In Proceedings GandALF 2012, arXiv:1210.2028
arxiv created 2012/10/09 · arxiv updated 2012/10/10
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, 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.