The importance of equivalence relation (on processes) defined in algebraic theories of processes (like CCS, CSP, DCP, etc.) is well known. This paper deals with the equivalence relation in the DCP model. After a brief overview of some equivalences on labelled transitions systems and the relations between them, the authors, in order to find the place of the Johnston's equivalence (in DCP) in the chain of existing equivalences, defines a new partial order between processes which induces a new equivalence relation. It is proved that this new relation is finer than the original one and in fact is the bisimulation relation of Park.
- A calculus of communicating systems
- A calculus of total correctness for communicating processes
- A lattice-theoretical fixpoint theorem and its applications
- A Theory of Communicating Sequential Processes
- Acceptance trees
- Algebra of communicating processes with abstraction
- Algebraic laws for nondeterminism and concurrency
- Automated Analysis of Discrete Communication Behavior
- Calculi for synchrony and asynchrony
- CIRCAL and the representation of communication, concurrency, and time
- Communicating sequential processes
- Extensional equivalences for transition systems
- scientific article; zbMATH DE number 3124495 (Why is no real title available?)
- scientific article; zbMATH DE number 3817027 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3635472 (Why is no real title available?)
- Testing equivalences for processes
This page was built for publication: The equivalence in the DCP model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177152)
