Bisimulation Can't Be Traced

@inproceedings{Bloom1988BisimulationCB,
  title={Bisimulation Can't Be Traced},
  author={Bard Bloom and Sorin Istrail and Albert R. Meyer},
  booktitle={POPL},
  year={1988}
}
Bisimulation is the primitive notion of equivalence between concurrent processes in Milner's Calculus of Communicating Systems (CCS); there is a nontrivial game-like protocol for distinguishing nonbisimular processes. In contrast, process distinguishability in Hoare's theory of Communicating Sequential Processes (CSP) is determined solely on the basis of traces of visible actions. We examine what additional operations are needed to explain bisimulation similarly—specifically in the case of… CONTINUE READING
Highly Influential
This paper has highly influenced 51 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 287 extracted citations

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Tutorial on concurrency

  • S. ABRAMSKY
  • Slides of an invited lecture given at the 16th…
  • 1989
Highly Influential
8 Excerpts

Computational complexity of bisimulation in SCCS

  • B. BLOOM
  • Unpublished.
  • 1987
Highly Influential
7 Excerpts

Applications of process algebra

  • J.C.M. BAETEN
  • Cambridge Tracts in Theoretical Computer Sczence…
  • 1990
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…