Abstract
Adding priorities to CCS is difficult, and involves two-stage operational semantics or other complications. By contrast, priorities can be added very simply to a calculus of broadcasting systems (CBS). The reason is the input/output distinction made in CBS, with output actions being autonomous. Priority makes sense only for autonomous actions.
As in unprioritised CBS, both strong and weak bisimulation are congruences, and capture the intuitively desired equivalences. CBS is also a powerful and natural language, offering an interesting new programming paradigm. Several examples show that priorities extend both the power and the paradigm.
Funding: From the Swedish Government agencies TFR and NUTEK, the latter supporting Chalmers' membership of the Esprit Basic Research Action CONCUR2.
Chapter PDF
Similar content being viewed by others
Key words and phrases
References
Lennart Augustsson and Thomas Johnsson. Lazy ML user's manual. Technical report, Department of Computer Science, Chalmers University of Technology, 1993.
M. Ben-Ari. Principles of Concurrent and Distributed Programming. Prentice-Hall, 1990.
J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Technical Report CSR8503, Centre for Mathematics and Computer Science, Amsterdam, 1985.
Gérard Berry and Georges Gonthier. The ESTEREL synchronous programming language: Design, semantics, implementation. Science of Computer Programming, 19, 1992.
J.-P. Banâtre and D. Le Metayer, editors. Research Directions in High-Level Parallel Programming Languages. Springer Verlag LNCS 574, 1991.
F. W. Burton. Nondeterminism with referential transparency in functional languages. The Computer Journal, 31(3):243–247, 1988.
Linda Christoff and Ivan Christoff. Observational equivalence for processes with priorities. Technical report, Dept. of Computer Systems, Uppsala Univ., 1993.
Nicholas Carriero and David Gelernter. Linda in context. Communications of the ACM, 32(4):444–458, April 1989.
Rance Cleaveland and Matthew Hennessy. Priorities in process algebras. In Symposium on Logic in Computer Science. IEEE, 1988.
Juanito Camilleri and Glynn Winskel. CCS with priority choice. In Symposium on Logic in Computer Science. IEEE, 1991.
David Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8, 1987.
Alan Jeffrey. Translating timed process algebra into prioritised process algebra. In Nijmegen Symposium on Real-Time and Fault-Tolerant Systems, 1992.
Nancy Lynch and Mark Tuttle. Hierarchical correctness proofs for distributed algorithms. Technical Report MIT/LCS/TR-387, Laboratory for Computer Science, Massachusetts Institute of Technology, 1987.
Robin Milner. Communication and Concurrency. Prentice Hall, 1989.
K. V. S. Prasad. A calculus of broadcasting systems. In TAPSOFT'91 Volume 1: CAAP, April 1991. Springer Verlag LNCS 493.
K. V. S. Prasad. Broadcasting in time. Technical report, Department of Computer Science, Chalmers University of Technology, 1993.
K. V. S. Prasad. A calculus of value broadcasts. In PARLE'93, June 1993. Springer Verlag LNCS 694.
K. V. S. Prasad. Programming with broadcasts. In CONCUR'93, August 1993. Springer Verlag LNCS 715.
C. Runciman and D. Wakeling. Profiling parallelism. Internal report, Department of Computer Science, University of York, 1993.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prasad, K.V.S. (1994). Broadcasting with priority. In: Sannella, D. (eds) Programming Languages and Systems — ESOP '94. ESOP 1994. Lecture Notes in Computer Science, vol 788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57880-3_31
Download citation
DOI: https://doi.org/10.1007/3-540-57880-3_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57880-2
Online ISBN: 978-3-540-48376-2
eBook Packages: Springer Book Archive