Interface simulation distances - Cerny, Pavol; Chmelik, Martin; Henzinger, Thomas A; Radhakrishna, Arjun; Quantitative Reactive Modeling; Moderne Concurrency Paradigms; Game Theory; Modern Graph Algorithmic Techniques in Formal Verification; Quantitative Graph Games: Theory and Applications; Microsoft Research Faculty Fellowship (Theoretical Computer Science, 2014)
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.
published
yes
Keywords: article