Abstract
This paper describes three real-time process algebras, ACSR, PACSR and ACSR- VP. ACSR is a resource-bound real-time process that supports synchronous timed actions and asynchronous instantaneous events as well as the notions of resource, priority, exception, and interrupt. PACSR is a probabilistic extension of ACSR with resources that can fail and associated failure probabilities. ACSR-VP extends ACSR with value passing between processes and parameterized process definitions. This paper also provides three simple real-time system examples to illustrate the expressive power and analysis technique of each process algebra.
Chapter PDF
References
H. Ben-Abdallah. GCSR: A Graphical Language for the Specification, Refinement and Analysis of Real-Time Systems. PhD thesis, Department of Computer and Information Science, University of Pennsylvania, 1996. Tech Rep IRCS-96-18.
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, J.Y. Choi, and I. Lee. A complete axiomatization of finite-state acsr processes. Information and Computation, 138(2):124–159, Nov 1997.
P. Brémond-Grégoire and I. Lee. Process Algebra of Communicating Shared Resources with Dense Time and Priorities. Theoretical Computer Science, 189: 179–219, 1997.
M. Hennessy. Algebraic Theory of Processes. MIT Press Series in the Foundations of Computing. MIT Press, 1988.
M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138:353–389, 1995.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
Hee-Hwan Kwak, Jin-Young Choi, Insup Lee, and Anna Philippou. Symbolic weak bisimulation for value-passing calculi. Technical Report MS-CIS-98-22, University of Pennsylvania, Department of Computer and Information Science, 1998.
H.H. Kwak, I. Lee, A. Philippou, J.Y. Choi, and O. Sokolsky. Symbolic schedulability analysis of real-time systems. In Proceedings of IEEE Real-Time Systems Symposium. IEEE Computer Society Press, 1998.
I. Lee, P. Brémond-Grégoire, and R. Gerber. A Process Algebraic Approach to the Specification and Analysis of Resource-Bound Real-Time Systems. Proceedings of the IEEE, pages 158–171, Jan 1994.
H. Lin. Symbolic graphs with assignment. In V. Sassone U. Montanari, editor, Proceedings CONCUR 96, volume 1119 of Lecture Notes in Computer Science, pages 50–65. Springer-Verlag, 1996.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
P. Paczkowski. Characterizing bisimilarity of value-passing parameterised processes. In Proceedings of the Infinity Workshop on Verification of Infinite State Systems, pages 47–55, 1996.
D. Park. Concurrency and Automata on Infinite Sequences. In Proc. of 5th GI Conference. LNCS 104, Springer Verlag, 1981.
A. Philippou, R. Cleaveland, I. Lee, S. Smolka, and O. Sokolsky. Probabilistic resource failure in real-time process algebra. In Proc. of CONCUR’98, pages 389–404. LNCS 1466, Springer Verlag, September 1998.
A. Philippou, O. Sokolsky, and I. Lee. Weak bisimulation for probabilistic systems. In Proc. of CONCUR’00, pages 334–349. LNCS 1877, Springer Verlag, August 2000.
J. Rathke. Symbolic Techniques for Value-passing Calculi. PhD thesis, University of Sussex, 1997.
R. Saigal. Linear Programming: A Modern Integrated Analysis. Kluwer Academic Publishers, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 IFIP International Federation for Information Processing
About this paper
Cite this paper
Lee, I., Choi, JY., Hwan Kwak, H., Philippou, A., Sokolsky, O. (2001). A Family of Resource-Bound Real-Time Process Algebras. In: Kim, M., Chin, B., Kang, S., Lee, D. (eds) Formal Techniques for Networked and Distributed Systems. FORTE 2001. IFIP International Federation for Information Processing, vol 69. Springer, Boston, MA. https://doi.org/10.1007/0-306-47003-9_27
Download citation
DOI: https://doi.org/10.1007/0-306-47003-9_27
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-7470-1
Online ISBN: 978-0-306-47003-5
eBook Packages: Springer Book Archive