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.
Recommendations
Cites work
- An introduction to metric semantics: Operational and denotational models for programming and specification languages
- Game Refinement Relations and Metrics
- Generalized mean-payoff and energy games
- scientific article; zbMATH DE number 1617314 (Why is no real title available?)
- scientific article; zbMATH DE number 2017345 (Why is no real title available?)
- scientific article; zbMATH DE number 2017358 (Why is no real title available?)
- scientific article; zbMATH DE number 2209335 (Why is no real title available?)
- Interface simulation distances
- Metrics for labelled Markov processes
- Modal I/O Automata for Interface and Product Line Theories
- Simulation distances
- Simulation distances
- Statecharts: a visual formalism for complex systems
- The complexity of mean payoff games on graphs
Cited in
(6)
This page was built for publication: Interface simulation distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477211)
