Abstract
In a previous paper we had defined the notion of an efficiency preorder for concurrent systems. In this paper, we present a coarser relation, called the elaboration preorder, which is finer than observational equivalence. Further, this preorder is incomparable with the almost-weak bisimulation preorder of Sangiorgi and Milner. In particular, the elaboration preorder is preserved under all contexts except summation. The largest precongruence contained in it, which we call conformance, is obtained by the usual means and a complete axiomatization for conformance of finite processes is given. The paper ends with an example to show the use of this relation.
Supported by project grant SR/OY/M-08/92 of the Department of Science and Technology, Govt. of India.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Arun-Kumar, M. Hennessy, An efficiency preorder for processes, Acta Informática, 29: 737–760, 1992.
R. Cleaveland, J. Parrow, B. Steffen, The concurrency workbench: A semantics-based verification tool for finite-state systems, Proceedings of the Workshop on Automated Verification Methods for Finite- state Systems, Lecture Notes in Computer Science 407, Springer-Verlag, 1989.
R. Milner, Communication and Concurrency, Prentice-Hall International, 1989.
R. Milner, Expansions, handwritten notes, 1990.
R. Milner, Contractions, handwritten notes, 1990.
F. Moller, The Edinburgh Concurrency Workbench (Version 6.1), Department of Computer Science, University of Edinburgh, 1992.
D. Sangiorgi, R. Milner, The problem of “weak bisimulation up to”, CONCUR 92, Lecture Notes in Computer Science 630, Springer-Verlag, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 British Computer Society
About this paper
Cite this paper
Arun-Kumar, S., Natarajan, V. (1995). Conformance: A Precongruence close to Bisimilarity. In: Desel, J. (eds) Structures in Concurrency Theory. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3078-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3078-9_4
Publisher Name: Springer, London
Print ISBN: 978-3-540-19982-3
Online ISBN: 978-1-4471-3078-9
eBook Packages: Springer Book Archive