Skip to main content
SpringerLink
Log in
Book cover

Semantics for Concurrency pp 81–95Cite as

Experimenting with Process Equivalence

  • Conference paper

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

Following paradigms originated by Hennessy, Hoare, and Milner, distinctions between concurrent processes based on observable outcomes of computational experiments are examined. Variations in experimental protocols yield several distinct experimental equivalences. The experimental scenario thus offers a uniform setting in which to compare notions of process equivalence. We identify one equivalence, called ready simulation, as offering a better motivated and equally elegant alternative to the widely accepted notion of bisimulation.

Supported by an NSF Fellowship, also NSF Grant No. 8511190-DCR and ONR grant No. N00014-83-K-0125.

Supported by NSF Grant No. 8511190-DCR and by ONR grant No. N00014-83-K-0125.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Sci., 53: 225–241, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  2. S. Abramsky and S. Vickers. Quantales, observational logic, and process semantics. Research Report DOC 90/1, Imperial College, London, 1990.

    Google Scholar 

  3. D. Austry and G. Boudol. Algèbre de processus et synchronisation. Theoretical Computer Sci., 30: 91–131, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  4. J. C. M. Baeten and R. J. van Glabbeek. Another look at abstraction in process algebra. In T. Ottman, editor, Automata, Languages and Programming 14th ICALP, volume 267 of Lect. Notes in Computer Sci., pages 84–94. Springer-Verlag, 1987.

    Google Scholar 

  5. J. A. Bergstra and J. W. Klop. Process algebra for synchronous communication. Information and Control, 60: 109–137, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  6. B. Bloom. Ready Simulation, Bisimulation, and the Semantics of CCS-Like Languages. PhD thesis, MIT, August 1989.

    Google Scholar 

  7. B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can’t be traced: Preliminary report. In 15“ Symp. Principles of Programming Languages,pages 229–239. ACM, 1988. Final version in preparation for journal submission.

    Google Scholar 

  8. B. Bloom and A. R. Meyer. A remark on the bisimulation of probabilistic processes. In A. Meyer and M. Taitslin, editors, Logic at Botik ‘89, Proceedings, volume 363 of Lect. Notes in Computer Sci., pages 26–40, July 1989.

    Google Scholar 

  9. R. de Simone. Higher-level synchronising devices in MEIDE-SCCS. Theoretical Computer Sci., 37: 245–267, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  10. R. DeNicola and M. C. Hennessy. Testing equivalences for processes. Theoretical Computer Sci., 34: 83–133, 1984.

    Article  MathSciNet  Google Scholar 

  11. J. F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence (extended abstract). In J. G. Ausiello, M. DezaniCiancaglini and S. Ronchi Della Rocca, editors, Automata, Languages, and Programming 16’ ICALP, volume 372 of Lect. Notes in Computer Sci., pages 423–438. Springer-Verlag, 1989.

    Google Scholar 

  12. M. C. B. Hennessy and R. Milner. On observing nondeterminism and concurrency. In J. D. Bakker and J. van Leeuwen, editors, Automata, Languages, and Programming, volume 85 of Lect. Notes in Computer Sci., pages 299–309. Springer-Verlag, 1980.

    Google Scholar 

  13. C. Hoare. Communicating sequential processes. Comm. ACM, 21: 666–677, 1978.

    Article  MATH  Google Scholar 

  14. C. A. R. Hoare. Communicating Sequential Processes. Series in Computer Science. Prentice-Hall, 1985. 256 pp.

    MATH  Google Scholar 

  15. K. Larsen and A. Skou. Bisimulation through probabilistic testing (preliminary report). In 16“ Symp. Principles of Programming Languages, pages 344–352. ACM, Jan. 1989.

    Google Scholar 

  16. R. Milner. A Calculus of Communicating Systems, volume 92 of Lect. Notes in Computer Sci. Springer-Verlag, 1980.

    Google Scholar 

  17. R. Milner. A modal characterisation of observable machine-behavior. In E. Astesiano and C. Böhm, editors, CAAP ‘81. Proceedings, volume 112 of Lect. Notes in Computer Sci. Springer-Verlag, 1981.

    Google Scholar 

  18. R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Sci., 25: 267–310, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  19. I. Phillips. Refusal testing. In L. Kott, editor,Automata, Languages and Programming 13th ICALP, volume 226 of Led. Notes in Computer Sci., pages 304–313. Springer-Verlag, 1986.

    Google Scholar 

  20. G. D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus Univ., Computer Science Dept., Denmark, 1981.

    Google Scholar 

  21. A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In W. Brauer, editor, Automata, Languages, and Programming, volume 194 of Led. Notes in Computer Sci., pages 15–32. Springer-Verlag, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, Ithaca, NY, 14853, USA

    Bard Bloom

  2. Laboratory for Computer Science, MIT Cambridge Ma., 02139, USA

    Albert R. Meyer

Authors
  1. Bard Bloom
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Albert R. Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bloom, B., Meyer, A.R. (1990). Experimenting with Process Equivalence. In: Semantics for Concurrency. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3860-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3860-0_6

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19625-9

  • Online ISBN: 978-1-4471-3860-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation