Abstract
In the calculus of broadcasting systems (CBS), speech is autonomous, but hearing takes place only when the environment speaks. This paper develops a timed CBS (TCBS) where no time may pass if there is speech pending. A process wishing to speak can be forced, by attaching a time-out to it, to first listen for a specified length of time. Those forced to wait for a long time can be seen as having low priority. This reading is consistent with PCBS, which is CBS with priorities. TCBS has an expansion theorem even if time is dense. A delay prefix operator can be derived up to weak bisimulation if time dependent behaviour is allowed.
TCBS casts, by contrast, light on handshake communication: on time abstracted bisimulation, and on the relations between time and priority, between expansion theorems and density of time, and between delays and time-outs.
Funding: Swedish Government agency TFR and Esprit BRA CONCUR2.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Jörgen Andersen, Ed Harcourt, and K.V.S. Prasad. A machine verified sorting algorithm. Preliminary version, 1995.
Rance Cleaveland and Matthew Hennessy. Priorities in process algebras. Information and Computation, 87, 1990.
Juanito Camilleri and Glynn Winskel. CCS with priority choice. In Symposium on Logic in Computer Science. IEEE, 1991.
Jens Chr. Godskesen and Kim G. Larsen. Real-time calculi and expansion theorems. In FST&TCS'92, 1992. Springer Verlag LNCS 652.
Matthew Hennessy. Timed process algebras: a tutorial. In Marktoberdorf Summer School on process design calculi, 1992.
Ed Harcourt, Pawel Paczkowski, and K.V.S. Prasad. A framework for representing value-passing parametric processes. Preliminary version, 1995.
Matthew Hennessy and Tim Regan. A temporal process algebra. Computer Science Internal Report 2/90, University of Sussex, 1990.
Alan Jeffrey. Observation Spaces and Timed Processes. D.phil, Oxford University, 1992.
Alan Jeffrey. Translating timed process algebra into prioritised process algebra. In Nijmegen Symposium on Real-Time and Fault-Tolerant Systems, 1992.
Kim Larsen and Wang Yi. Time abstracted bisimulation: Implicit specifications and decidability. In Mathematical Foundations of Programming Semantics, 1993.
Robin Milner. Communication and Concurrency. Prentice Hall, 1989.
K. V. S. Prasad. Programming with broadcasts. In CONCUR, August 1993. Springer Verlag LNCS 715.
K. V. S. Prasad. Broadcasting with priority. In ESOP, April 1994. Springer Verlag LNCS 788.
K. V. S. Prasad. A calculus of broadcasting systems. Science of Computer Programming, 25, 1995.
C. Runciman and D. Wakeling. Profiling parallelism. Internal report, Department of Computer Science, University of York, 1993.
Wang Yi. Real time behaviour of asynchronous agents. In CONCUR'90, 1990. Springer Verlag LNCS 458.
Wang Yi. A Calculus of Real Time Systems. PhD thesis, Chalmers University of Technology, June 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prasad, K.V.S. (1996). Broadcasting in time. In: Ciancarini, P., Hankin, C. (eds) Coordination Languages and Models. COORDINATION 1996. Lecture Notes in Computer Science, vol 1061. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61052-9_54
Download citation
DOI: https://doi.org/10.1007/3-540-61052-9_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61052-6
Online ISBN: 978-3-540-49936-7
eBook Packages: Springer Book Archive