Skip to main content
SpringerLink
Log in

A process algebra with distributed priorities

  • Conference paper
  • First Online:
CONCUR '96: Concurrency Theory (CONCUR 1996)

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

Included in the following conference series:

Abstract

This paper presents a process algebra for distributed systems in which some actions may take precedence over others. In contrast with existing approaches to priorities, our algebra only allows actions to preempt others at the same “location” and therefore captures a notion of localized precedence. Using Park's and Milner's notion of strong bisimulation as a basis, we develop a behavioral congruence and axiomatize it for finite processes; we also derive an associated observational congruence. Simple examples highlight the utility of the theory.

Research supported by NSF grant CCR-9120995, ONR Young Investigator Award N00014-92-J-1582, NSF Young Investigator Award CCR-9257963, NSF grant CCR-9402807, and AFOSR grant F49620-95-1-0508.

Research support partly provided by the German Academic Exchange Service under grant D/95/09026 (Doktorandenstipendium HSP II/ AUFE).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Informaticae IX, pages 127–168, 1986.

    Google Scholar 

  2. E. Best and M. Koutny. Petri net semantics of priority systems. Theoretical Computer Science, 96:175–215, 1992.

    Google Scholar 

  3. G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. Theoretical Computer Science, 114(1):31–61, June 1993.

    Google Scholar 

  4. P. Brémonde-Grégoire, I. Lee, and R. Gerber. ACSR: An algebra of communicating shared resources with dense time and priorities. In E. Best, editor, CONCUR '93, volume 715 of Lecture Notes in Computer Science, pages 417–431, Hildesheim, Germany, August 1993. Springer-Verlag.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  7. R. Cleaveland, G. Lüttgen, and V. Natarajan. A process algebra with distributed priorities. Technical Report TR-96-02, North Carolina State University, March 1996.

    Google Scholar 

  8. R. Cleaveland, G. Lüttgen, V. Natarajan, and S. Sims. Priorities for modeling and verifying distributed systems. In T. Margaria and B. Steffen, editors, Second International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '96), volume 1055 of Lecture Notes in Computer Science, pages 278–297, Passau, Germany, March 1996. Springer-Verlag.

    Google Scholar 

  9. R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A semantics-based tool for the verification of finite-state systems. ACM Transactions on Programming Languages and Systems, 15(1):36–72, January 1993.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  13. R. Milner. Communication and Concurrency. Prentice-Hall, London, 1989.

    Google Scholar 

  14. U. Montanari and D. Yankelevich. A parametric approach to localities. In W. Kuich, editor, Automata, Languages and Programming (ICALP '92), volume 623 of Lecture Notes in Computer Science, pages 617–628, Vienna, July 1992. Springer-Verlag.

    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, volume 880 of Lecture Notes in Computer Science, pages 217–230, Madras, India, December 1994. Springer-Verlag.

    Google Scholar 

  16. R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM Journal of Computing, 16(6):973–989, December 1987.

    Google Scholar 

  17. D.M.R. Park. Concurrency and automata on infinite sequences. In Proceedings of 5th G.I. Conference on Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science, pages 167–183. Springer-Verlag, 1980.

    Google Scholar 

  18. K. V. S. Prasad. Broadcasting with priority. In Proceedings of the 5th European Symposium on Programming, volume 788 of Lecture Notes in Computer Science, pages 469–484, Edinburgh, U.K., April 1994. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, North Carolina State University, 27695-8206, Raleigh, NC, USA

    Rance Cleaveland & V. Natarajan

  2. Fakultät für Mathematik und Informatik, Universität Passau, 94030, Passau, Germany

    Gerald Lüttgen

Authors
  1. Rance Cleaveland
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerald Lüttgen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. Natarajan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ugo Montanari Vladimiro Sassone

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cleaveland, R., Lüttgen, G., Natarajan, V. (1996). A process algebra with distributed priorities. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-61604-7_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61604-7

  • Online ISBN: 978-3-540-70625-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation