Conformance: A Precongruence close to Bisimilarity
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.
KeywordsOperational Semantic Proof System Visible Action Label Transition System Process Expression
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- R. Milner, Communication and Concurrency, Prentice-Hall International, 1989.Google Scholar
- R. Milner, Expansions, handwritten notes, 1990.Google Scholar
- R. Milner, Contractions, handwritten notes, 1990.Google Scholar
- F. Moller, The Edinburgh Concurrency Workbench (Version 6.1), Department of Computer Science, University of Edinburgh, 1992.Google Scholar
- D. Sangiorgi, R. Milner, The problem of “weak bisimulation up to”, CONCUR 92, Lecture Notes in Computer Science 630, Springer-Verlag, 1992.Google Scholar