Skip to main content

Process Algebra

  • Chapter
  • First Online:
Refinement
  • 313 Accesses

Abstract

This chapter looks at these issues in process algebras. As a canonical example we look at CSP, but we also discuss CCS and LOTOS. The link to the semantics is made to Chap. 1 as well as elements of Chap. 5.

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

Access this chapter

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 EPUB and 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
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    The relation with “skip” as stuttering in Chap. 3 is that both do nothing, doing so successfully. However, the respective semantic models will turn out rather different.

  2. 2.

    Remember that unless we give an explicit definition, the interface is simply the set of events listed in the process definition.

References

  1. Schneider S (1999) Concurrent and real time systems: the CSP approach. Wiley, New York

    Google Scholar 

  2. Roscoe AW (1998) The theory and practice of concurrency. International series in computer science. Prentice Hall, Upper Saddle River

    Google Scholar 

  3. Milner R (1989) Communication and concurrency. Prentice-Hall, Upper Saddle River

    Google Scholar 

  4. Bolognesi T, Brinksma E (1988) Introduction to the ISO specification language LOTOS. Comput Netw ISDN Syst 14(1):25–59

    Google Scholar 

  5. Bergstra JA, Klop JW (1984) Process algebra for synchronous communication. Inf Control 60(1):109–137

    Google Scholar 

  6. Milner R (1999) Communicating and mobile systems: the \(\pi \)-calculus. Cambridge University Press, New York

    Google Scholar 

  7. Hoare CAR (1985) Communicating sequential processes. Prentice Hall, Upper Saddle River

    Google Scholar 

  8. Roscoe AW (2010) Understanding concurrent systems. Springer, Berlin

    Google Scholar 

  9. Bowman H, Gomez R (2005) Concurrency theory: calculi an automata for modelling untimed and timed concurrent systems. Springer, New York

    Google Scholar 

  10. ISO/IEC. International standard 15437:2001: Information technology – Enhancements to LOTOS (E-LOTOS) (2001)

    Google Scholar 

  11. de Nicola R, Hennessy MCB (1984) Testing equivalences for processes. Theor Comput Sci 34(1):83–133

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to John Derrick .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Derrick, J., Boiten, E. (2018). Process Algebra. In: Refinement. Springer, Cham. https://doi.org/10.1007/978-3-319-92711-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-92711-4_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-92709-1

  • Online ISBN: 978-3-319-92711-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics