Interface simulation distances

From MaRDI portal
Publication:477211

DOI10.1016/J.TCS.2014.08.019zbMATH Open1303.68076arXiv1210.2450OpenAlexW2049708124MaRDI QIDQ477211FDOQ477211


Authors: Pavol Černý, Martin Chmelík, Thomas A. Henzinger, Arjun Radhakrishna Edit this on Wikidata


Publication date: 2 December 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1210.2450




Recommendations




Cites Work


Cited In (5)





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)