Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 2001: CONCUR 2001 — Concurrency Theory pp 305–320Cite as

CCS with Priority Guards

  • Conference paper
  • First Online:

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

Abstract

It has long been recognised that standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Various solutions have been proposed. We introduce a new approach, involving the addition of “priority guards” to Milner’s process calculus CCS. In our approach, priority is unstratified, meaning that actions are not assigned fixed levels, so that the same action can have different priority depending where it appears in a program. Unlike in other unstratified accounts of priority in CCS (such as that of Camilleri and Winskel), we treat inputs and outputs symmetrically. We introduce the new calculus, give examples, develop its theory (including bisimulation and equational laws), and compare it with existing approaches. We show that priority adds expressiveness to both CCS and the π-calculus.

Partially funded by EPSRC grant GR/K54663

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. J.C.M. Baeten, J. Bergstra, and J.-W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Informaticae, 9:127–168, 1986.

    MATH  MathSciNet  Google Scholar 

  2. J. Bergstra and J.-W. Klop. Process algebra for synchronous communication. Information and Computation, 60:109–137, 1984.

    MATH  MathSciNet  Google Scholar 

  3. J. Camilleri and G. Winskel. CCS with priority choice. Information and Computation, 116(1):26–37, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Cleaveland and M.C.B. Hennessy. Priorities in process algebra. Information and Computation, 87(1/2):58–77, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Cleaveland, G. Lüttgen, and V. Natarajan. Priority in process algebra. In J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of Process Algebra. Elsevier, 2001.

    Google Scholar 

  6. C. Ene and T. Muntian. Expressiveness of point-to-point versus broadcast communications. In FCT’ 99, volume 1684 of Lecture Notes in Computer Science, pages 258–268. Springer-Verlag, 1999.

    Google Scholar 

  7. C.J. Fidge. A formal definition of priority in CSP. ACM Transactions on Programming Languages and Systems, 15(4):681–705, 1993.

    Article  Google Scholar 

  8. H. Hansson and F. Orava. A process calculus with incomparable priorities. In Proceedings of the North American Process Algebra Workshop, pages 43–64, Stony Brook, New York, 1992. Springer-Verlag Workshops in Computer Science.

    Google Scholar 

  9. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.

    Google Scholar 

  10. A. Jeffrey. A typed, prioritized process algebra. Technical Report 13/93, Dept. of Computer Science, University of Sussex, 1993.

    Google Scholar 

  11. C.-T. Jensen. Prioritized and Independent Actions in Distributed Computer Systems. PhD thesis, Aarhus University, 1994.

    Google Scholar 

  12. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.

    Google Scholar 

  13. R. Milner. Communicating and Mobile Systems: the π-calculus. Cambridge University Press, 1999.

    Google Scholar 

  14. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Information and Computation, 100:1–77, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  15. V. Natarajan, L. Christoff, I. Christoff, and R. Cleaveland. Priorities and abstraction in process algebra. In P. S. Thiagarajan, editor, Foundations of Software Technology and Theoretical Computer Science, 14th Conference, volume 880 of Lecture Notes in Computer Science, pages 217–230. Springer-Verlag, 1994.

    Google Scholar 

  16. C. Palamidessi. Comparing the expressive power of the synchronous and the asynchronous π-calculus. In Proceedings of the 25th Annual Symposium on Principles of Programming Languages, POPL’ 97, pages 256–265. ACM, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College, London

    Iain Phillips

Authors
  1. Iain Phillips
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, BRICS, Aalborg University, Fredrik Bajersvej 7, 9220, Aalborg, Denmark

    Kim G. Larsen

  2. BRICS, Aarhus University, Ny Munkegade, Bldg. 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Phillips, I. (2001). CCS with Priority Guards. In: Larsen, K.G., Nielsen, M. (eds) CONCUR 2001 — Concurrency Theory. CONCUR 2001. Lecture Notes in Computer Science, vol 2154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44685-0_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-44685-0_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42497-0

  • Online ISBN: 978-3-540-44685-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation