Abstract
We introduce a notion of approximate bisimilarity in order to be able to reason about the approximate equivalence of processes. Approximate bisimilarity is based on the notion of bisimulation index for labelled transition systems. We establish some basic properties of bisimulation indexes and give a Hennessy-Milner logical characterization of approximate bisimilarity. As an application we show how to describe approximate correctness of real time systems by giving an example in real time ACP.
The first author was supported by the National Foundation for Distinguished Young Scholars (Grant No: 69725004), Research and Development Project of High-Technology (Grant No: 863-306-ZT06-04-3) and Foundation of Natural Sciences (Grant No: 69823001) of China and Fok Ying-Tung Education Foundation, and this work was carried out when the first author was at Institut für Informatik, Ludwig-Maximilians-Universtät München as an Alexander von Humboldt research fellow.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Arnold and M. Nivat. Metric Interpretations of Infinite Trees and Semantics of Nondeterministic Recursive Programs. Theoretical Computer Science, 11:181–205, 1980.
A. Arnold and M. Nivat. The Metric Space of Infinite Trees, Algebraic and Topological Properties. Fundamenta Informaticae, 4:445–476, 1980.
J. C. M. Baeten and J. Bergstra. Real-Time Process Algebra. Formal Aspects of Computing, 3:142–188, 1991.
J. W. de Bakker and J. J. M. M. Rutten, editors. Ten Years of Concurrency Semantics, Selected Papers of the Amsterdam Concurreny Group. World Scientific, Singapore, 1992.
J. W. de Bakker and J. I. Zucker. Processes and the Denotational Semantics of Concurrency. Information and Control, 54:70–120, 1982.
J. N. Kok and J. J. M. M. Rutten. Contractions in Comparing Concurrency Semantics. Theoretical Computer Science, 76:179–222, 1990.
R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer, Berlin, 1980.
R. Milner. Communication and Concurrency. Prentice Hall, New York, 1989.
F. van Breugel. Comparative Metric Semantics of Programming Languages: Nondeterminism and Recursion. Birkhäuser, Boston, 1998.
R. J. van Glabbeek and J. J. M. M. Rutten. The Processes of de Bakker and Zucker Represent Bisimulation Equivalences Classes. In J. W. de Bakker, editor, 25 Jaar Semantik, Liber Amicorum, pages 243–246. CWI, Amsterdam, 1989.
Y. Wang. Real-Time Behaviour of Asynchronous Agents. In J. C. M. Baeten and J. W. Klop, editors, Proc. CONCUR’90, volume 458 of Lecture Notes in Computer Science, pages 502–520. Springer, Berlin, 1990.
M. S. Ying and M. Wirsing. Approximate Bisimilarity and Its Applications. Technical report 9906, Institut für Informatik, Ludwig-Maximilians-Universität München, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ying, M., Wirsing, M. (2000). Approximate Bisimilarity. In: Rus, T. (eds) Algebraic Methodology and Software Technology. AMAST 2000. Lecture Notes in Computer Science, vol 1816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45499-3_23
Download citation
DOI: https://doi.org/10.1007/3-540-45499-3_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67530-3
Online ISBN: 978-3-540-45499-1
eBook Packages: Springer Book Archive