Skip to main content
SpringerLink
Log in

Generic Process Algebras for Asynchronous Communication

  • Conference paper
  • First Online:
CONCUR’99 Concurrency Theory (CONCUR 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1664))

Included in the following conference series:

Abstract

We study at different levels of abstraction general semantic and algebraic properties of languages which are based on asynchronous communication. These different levels of abstraction concern the specific nature of the communication mechanism. At the highest level we introduce a process algebra which characterizes asynchronous communication in general, that is, when abstracting from the specific nature of the communication mechanism. This generic process algebra we further instantiate to algebras for different classes of languages. Considered are classes of languages which are based on a general monoid structure of the actions and classes of languages which are based on read/write operations.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. C. M. Baeten and W. P. Weijland. Process algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press 1990.

    Google Scholar 

  2. J. A. Bergstra and J. W. Klop. Process algebra for communication and mutual exclusion. Technical Report CS-R8409, CWI, 1984.

    Google Scholar 

  3. J. A. Bergstra, J. W. Klop, and E.-R. Olderog. Readies and failures in the algebra of communicating systems. SIAM J. Comp., 17(6):1134–1177, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  4. F. S. de Boer, J. W. Klop and C. Palamidessi. Asynchronous communication in process algebra. Proc. of the seventh annual IEEE symposium on Logics in Computer Science (LICS), pages 137–147. IEEE Computer Society Press, Los Alamitos, California, 1992.

    Chapter  Google Scholar 

  5. F. S. de Boer, J. N. Kok, C. Palamidessi, and J. J. M. M. Rutten. The failure of failures: Towards a paradigm for asynchronous communication. Proc. of Concur’ 91, Lecture Notes in Computer Science, Vol. 527, pages 111–126, Amsterdam, The Netherlands, 1991.

    Google Scholar 

  6. F. S. de Boer and C. Palamidessi. A process algebra of concurrent constraint programming. Proc. of the Joint International Conference and Symposium on Logic Programming, JICSLP’92, pages 463–477, The MIT press, 1992.

    Google Scholar 

  7. M. Boreale, R. De Nicola, R. Pugliese. Asynchronous observations of processes. Proc. of FoSSaCS’98, Lecture Notes in Computer Science, 1998.

    Google Scholar 

  8. A. Brogi and P. Ciancarini. The concurrent language Shared Prolog. ACM Transaction on Programming Languages and Systems, 13(1):99–123, 1991.

    Article  Google Scholar 

  9. S. D. Brookes. Full abstraction for a shared-variable parallel language. Information and Computation, 127(2):145–163, 15 June 1996.

    Article  MATH  MathSciNet  Google Scholar 

  10. N. Busi, R. Gorrieri, and G. Zavattaro. A process algebraic view of Linda coordination primitives. Theoretical Computer Science, 192(2):167–199, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  11. P. Ciancarini, R. Gorrieri, and G. Zavattaro. An alternative semantics for the parallel operator of the calculus of gamma programs. Coordination Programming: Mechanism, Models and Semantics, pages 232–248, Imperial College Press, 1996.

    Google Scholar 

  12. R. De Nicola and R. Pugliese. A process algebra based on Linda. Proc. of Coordination’96, Lecture Notes of Computer Science, Vol. 1061, pages 160–178, 1996.

    Google Scholar 

  13. E. W. Dijkstra. Cooperating sequential processes. In Academic Press, New York, 1968.

    Google Scholar 

  14. D. Erman, F. HayesRoth, V. Lesser, and D. Reddy. The Hearsay2 speech understanding system: Integrating knowledge to resolve uncertainty. ACM Computing Surveys, 12:213–253, 1980.

    Article  Google Scholar 

  15. D. Gelenter. Generative communication in Linda. ACM TOPLAS, 7(1):80–112, 1986.

    Article  Google Scholar 

  16. L. Henkin, J. D. Monk, and A. Tarski. Cylindric Algebras (Part I). North-Holland, 1971.

    Google Scholar 

  17. C. A. R. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):666–677, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  18. He Jifeng, M. B. Josephs, and C. A. R. Hoare. A theory of synchrony and asynchrony. Proc. of IFIP Working Conference on Programming Concepts and Methods, pages 459–478, 1990.

    Google Scholar 

  19. G. Kahn. The semantics of a simple language for parallel programming. Information Processing 74: Proc. of IFIP Congress, pages 471–475, New York, 1974. North-Holland.

    Google Scholar 

  20. R. Milner. A Calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 92, New York, 1980.

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  22. V. A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, january 1989. The MIT Press.

    Google Scholar 

  23. E. Y. Shapiro. The family of concurrent logic programming languages. ACM Computing Surveys, 21(3):412–510, 1989.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Utrecht University, The Netherlands

    F. S. de Boer

  2. Dipartimento di Scienze dell’Informazione, Università di Bologna, Italy

    G. Zavattaro

Authors
  1. F. S. de Boer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Zavattaro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten  & Sjouke Mauw  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Boer, F.S., Zavattaro, G. (1999). Generic Process Algebras for Asynchronous Communication. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-48320-9_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66425-3

  • Online ISBN: 978-3-540-48320-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation