Interface Simulation Distances

Pavol Černý
(IST Austria)
Martin Chmelík
(IST Austria)
Thomas A. Henzinger
(IST Austria)
Arjun Radhakrishna
(IST Austria)

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.

In Marco Faella and Aniello Murano: Proceedings Third International Symposium on Games, Automata, Logics and Formal Verification (GandALF 2012), Napoli, Italy, September 6-8, 2012, Electronic Proceedings in Theoretical Computer Science 96, pp. 29–42.
Published: 7th October 2012.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: