Skip to main content
SpringerLink
Log in

A Process Calculus with Incomparable Priorities

  • Conference paper
NAPAW 92

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

Abstract

We define an asynchronous process calculus in which priorities are associated to transitions. The calculus distinguishes between transitions originating from different processes by regarding their priorities to be incomparable. We define a prioritized bisimulation equivalence and discuss its relation to “the natural” congruence relation for our calculus. We illustrate the calculus with two small examples.

This is a substantially revised version of a paper that appeared under the same title and by the same authors in the NAPAW participant’s proceedings.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Aceto. On relating concurrency and nondeterminism. In Proc. Chalmers Workshop on Concurrency, Bå,stad, Sweden, May 1991. Also available as Technical Report 6/89, University of Sussex, 1989.

    Google Scholar 

  2. J. Baeten, J. Bergstra, and J. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Fondamenta Informaticae, 9: 127–168, 1986.

    MATH  Google Scholar 

  3. G. Boudol and I. Castellani. Permutation of transitions: An event structure semantics for CCS and SCCS. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 411–427. Springer Verlag, 1988.

    Google Scholar 

  4. G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. In Proc. Chalmers Workshop on Concurrency, Båstad, Sweden, May 1991. Also available as Technical Report 4/91, University of Sussex, 1991.

    Google Scholar 

  5. J. Camilleri. A conditional operator for CCS. In J. Baeten and J.-F. Groote, editors, Proc. CONCUR’91 2 nd International Conference on Concurrency Theory, volume 527 of Lecture Notes in Computer Science, pages 142–156. Springer Verlag, August 1991.

    Google Scholar 

  6. R. Cleaveland and M. Hennessy. Priorities in process algebra. In Proc. 3 rd IEEE Int. Symp. on Logic in Computer Science, pages 193–202. IEEE Computer Society Press, 1988.

    Google Scholar 

  7. J. Camilleri and G. Winskel. CCS with priority choice. In Proc. 6 th, IEEE Int. Symp. on Logic in Computer Science. IEEE Computer Society Press, July 1991.

    Google Scholar 

  8. P. Degano, R. De Nicola, and U. Montanari. Partial orderings descriptions and observations of nondeterministic concurrent processes. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 438–466. Springer Verlag, 1988.

    Google Scholar 

  9. G. Ferrari, R. Gorrieri, and U. Montanari. An extended expansion theorem. In S. Abramsky and T.S.E Mailbaum, editors, TAPSOFT’91, volume 494 of Lecture Notes in Computer Science, pages 29–48. Springer Verlag, 1991.

    Google Scholar 

  10. R. Gerber and I. Lee. CCSR: a calculus for communicating shared resources. In J.C.M. Baeten and J.W. Klop, editors, Proc. CONCUR’90 Theories of Concurrency: Unification and Extension, volume 458 of Lecture Notes in Computer Science, pages 263–277. Springer Verlag, 1990.

    Chapter  Google Scholar 

  11. H. Hansson and F. Orava. A calculus with incomparable priorities. Technical report, Swedish Institute of Computer Science. In preparation.

    Google Scholar 

  12. A. Jeffrey. Translating timed process algebra into prioritized process algebra. In J. Vytopil, editor, Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 571 of Lecture Notes in Computer Science, pages 493–506. Springer Verlag, 1992.

    Google Scholar 

  13. R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer Verlag, 1980.

    Google Scholar 

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

    Google Scholar 

  15. G. Plotkin. A structural approach to operational semantics. Technical report, DAIMI FN-19, Dept. of Computer Science, Aarhus University, Aarhus, Denmark, 1981.

    Google Scholar 

  16. S. Smolka and B. Steffen. Priority as extremal probability. In J.C.M. Baeten and J.W. Klop, editors, Proc. CONCUR’90 Theories of Concurrency: Unification and Extension, volume 458 of Lecture Notes in Computer Science, pages 456–466. Springer Verlag, 1990.

    Chapter  Google Scholar 

  17. C. Tofts. A synchronous calculus of relative frequency. In J.C.M. Baeten and J.W. Klop, editors, Proc. CONCUR’90 Theories of Concurrency: Unification and Extension, volume 458 of Lecture Notes in Computer Science, pages 467–480. Springer Verlag, 1990.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Swedish Institute of Computer Science, Box 1263, S-164 28, Kista, Sweden

    Hans Hansson & Fredrik Orava

  2. Department of Computer Systems, Uppsala University, Sweden

    Hans Hansson & Fredrik Orava

Authors
  1. Hans Hansson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fredrik Orava
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, 333 Whitmore Laboratory, The Pennsylvania State University, 16802, University Park, PA, USA

    S. Purushothaman PhD

  2. Department of Computer Science, The Johns Hopkins University, 21218, Baltimore, MD, USA

    Amy Zwarico

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Hansson, H., Orava, F. (1993). A Process Calculus with Incomparable Priorities. In: Purushothaman, S., Zwarico, A. (eds) NAPAW 92. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3217-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3217-2_4

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19822-2

  • Online ISBN: 978-1-4471-3217-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation