Conformance: A Precongruence close to Bisimilarity

  • S. Arun-Kumar
  • V. Natarajan
Part of the Workshops in Computing book series (WORKSHOPS COMP.)


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.


Operational Semantic Proof System Visible Action Label Transition System Process Expression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. Arun-Kumar, M. Hennessy, An efficiency preorder for processes, Acta Informática, 29: 737–760, 1992.CrossRefMATHMathSciNetGoogle Scholar
  2. [2]
    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
  3. [3]
    R. Milner, Communication and Concurrency, Prentice-Hall International, 1989.Google Scholar
  4. [4]
    R. Milner, Expansions, handwritten notes, 1990.Google Scholar
  5. [5]
    R. Milner, Contractions, handwritten notes, 1990.Google Scholar
  6. [6]
    F. Moller, The Edinburgh Concurrency Workbench (Version 6.1), Department of Computer Science, University of Edinburgh, 1992.Google Scholar
  7. [7]
    D. Sangiorgi, R. Milner, The problem of “weak bisimulation up to”, CONCUR 92, Lecture Notes in Computer Science 630, Springer-Verlag, 1992.Google Scholar

Copyright information

© British Computer Society 1995

Authors and Affiliations

  • S. Arun-Kumar
    • 1
  • V. Natarajan
    • 2
  1. 1.Department of Computer Science and EngineeringIndian Institute of TechnologyHauz Khas, New DelhiIndia
  2. 2.Department of Computer ScienceNorth Carolina State UniversityRaleighUSA

Personalised recommendations