Arrow Research search
Back to GandALF

GandALF 2012

Interface Simulation Distances

Workshop Paper Accepted Paper Automata Theory · Formal Methods · Logic in Computer Science

Abstract

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.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
International Symposium on Games, Automata, Logics, and Formal Verification
Archive span
2010-2025
Indexed papers
273
Paper id
791989637977630524