Abstract
This paper describes a timed process algebra called ACSR. ACSR supports synchronous timed actions and asynchronous instantaneous events. Timed actions are used to represent the usage of resources and to model the passage of time. Events are used to capture synchronization between processes. To be able to accurately specify real systems, ACSR supports a dense time domain and a notion of priority that can be used to arbitrate among timed actions competing for the use of resources and among events that are ready for synchronization. The paper also defines the compositionality of preemption and describes two fundamental ways to extend the priorities of individual events and actions to multiple events and actions without sacrificing compositionality.
This research was supported in part by ONR N00014-89-J-1131, DARPA/NSF CCR90-14621 and NSF CCR 92-09333.
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. Baeten, J. Bergstra, and J. Klop. Ready-Trace Semantics for Concrete Process Algebra with a Priority Operator. Computer Journal, 30(6):498–506, 1987.
G. Barrett. The Semantics of Priority and Fairness in occam. In Proc. of 5th Int. Conf. Math. Foundations of Programming Semantics, LNCS 442. Springer-Verlag, 1990.
J.A. Bergstra and J.W. Klop. Algebra of Communicating Processes with Abstraction. Journal of Theoretical Computer Science, 37:77–121, 1985.
P. Brémond-Grégoire, S. Davidson, and I. Lee. CCSR 92 Calculus for Communicating Shared Resources, vintage 92. In Proc. of the First North American Process Algebra Workshop, 1992.
J. Camilleri and G. Winskel. CCS with Priority Choice. In Proc. of IEEE Symposium on Logic in Computer Science, 1991.
Liang Chen. An Interleaving Model for Real-Time Systems. Technical Report ECS-LFCS-91-184, Department of Computer Science, University of Edinburgh, November 1991.
R. Cleaveland and M. Hennessy. Priorities in Process Algebras. Information and Computation, 87:58–77, 1990.
J. Davies and S. Schneider. An Introduction to Timed CSP. Technical Report PRG-75, Oxford University Computing Laboratory, UK, August 1989.
R. Gerber and I. Lee. A Resource-Based Prioritized Bisimulation for Real-Time Systems. Technical Report MS-CIS-90-69, University of Pennsylvania, Department of Computer and Information Science, September 1990. To appear in Information and Computation.
R. Gerber and I. Lee. CCSR: A Calculus for Communicating Shared Resources. In Proc. of CONCUR '90. LNCS 458, Springer Verlag, August 1990.
J.C. Godskesen and K. Larsen. Real-Time Calculi and Expansion Theorems. In Proc. of the First North American Process Algebra Workshop, 1992.
M. Hennessy. Algebraic Theory of Processes. MIT Press Series in the Foundations of Computing. MIT Press, 1988.
M. Hennessy and T. Regan. A Process Algebra for Timed Systems. Technical Report 5/91, Univ. of Sussex, UK, April 1991.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
R. Milner. A Calculus for Communicating Systems. LNCS 92, Springer-Verlag, 1980.
R. Milner. Calculi for Synchrony and Asynchrony. Theoretical Computer Science, 25:267–310, 1983.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
F. Moller and C. Tofts. A Temporal Calculus of Communicating Systems. In Proc. of CONCUR '90, pages 401–415. LNCS 458, Springer Verlag, August 1990.
X. Nicollin and J. Sifakis. The Algebra of Timed Processes ATP: Theory and Application. Technical Report RT-C26, Institut National Polytechnique De Grenoble, November 1991.
D. Park. Concurrency and Automata on Infinite Sequences. In Proc. of 5th GI Conference. LNCS 104, Springer Verlag, 1981.
G.M. Reed and A.W. Roscoe. Metric Spaces as Models for Real-Time Concurrency. In Proc. of Math. Found. of Computer Science. LNCS 298, Springer Verlag, 1987.
F. Vaandrager and N. Lynch. Action Transducers and Timed Automata. In Proc. CONCUR '92, International Conference on Concurrency Theory. LNCS 630, Springer-Verlag, August 1992.
Wang Yi. CCS + Time=An Interleaving Model for Real Time Systems. In Proc. of Int. Conf. on Automata, Languages and Programming, July 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brémond-Grégoire, P., Lee, I., Gerber, R. (1993). ACSR: An algebra of communicating shared resources with dense time and priorities. In: Best, E. (eds) CONCUR'93. CONCUR 1993. Lecture Notes in Computer Science, vol 715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57208-2_29
Download citation
DOI: https://doi.org/10.1007/3-540-57208-2_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57208-4
Online ISBN: 978-3-540-47968-0
eBook Packages: Springer Book Archive