Abstract
A process algebra with priority and time is presented, based on linear timed CCS. It is given a set of axioms and a transition system semantics. The axioms are then shown to be equivalent to strong bisimulation over the transitions. It is shown how to translate any timed process into the untimed algebra, by time-stamping each action, Thus, maximal progress is shown to be a specific example of maximal priority.
Preview
Unable to display preview. Download preview PDF.
References
J. C. M. Baeten and J. A. Bergstra. Real time process algebra. Formal Aspects Comp. Sci., 3:142–188, 1991.
J. C. M. Baeten, J. A. Bergstra and J. W. Klop. Syntax and defining equations for an interrupt operator in process algebra. Fund. Inform., 9(2):127–168, 1986.
S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A theory of communicating sequential processes. J. Assoc. Comput. Mach., 31(3):560–599, 1984.
S. D. Brookes. A Model for Communicating Sequential Processes, D.Phil. thesis, Oxford University, 1983.
S. D. Brookes, A. W. Roscoe, and D. J. Walker. An operational semantics for CSP. Submitted for publication, 1986.
Juanito Camilleri. Priority in Process Calculi. PhD thesis, Cambridge University, 1990.
Juanito Camilleri. A conditional operator for CCS. In J. C. M. Baeten and J. F. Groote, editors, Proc. Concur 91, pages 142–156. Springer-Verlag, 1991.
R. Cleveland and M. Hennessy. Priorities in process algebra. In Proc. LICS 88. The Computer Society, 1988.
Ivan Christoff. Testing equivalences and fully abstract models for probabilistic processes. In Proc. Concur 90, pages 126–141. Springer Verlag, 1990. LNCS 458.
Jim Davies. Specification and Proof in Real-time Systems. D.Phil. thesis, Oxford University, 1991.
M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
Hans Hansson and Bengt Jonsson. A calculus for communicating systems with time and probabilities. Swedish Institute for Computer Science, 1990.
C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
M. Hennessy and T. Regan. A temporal process algebra. Technical Report 2/90, CSAI, University of Sussex, 1990.
M. Hennessy and T. Regan. A process algebra for timed systems. Submitted for publication, 1991.
Alan Jeffrey. A linear time process algebra. In Kim G. Larsen and Arne Skou, editors, Proc. CAV 91. Springer-Verlag, 1991. To appear in LNCS.
Kim G. Larsen and Arne Skou. Bisimulation through probabilistic testing. In Proc. 16th ACM Symp. on Principles of Programming Languages, 1989.
Robin Milner. A Calculus of Communicating Systems. Springer-Verlag, 1980. LNCS 92.
Robin Milner. A complete inference system for a class of regular behaviours. J. Comput. System Sci., 28:439–466, 1984.
Robin Milner. Communication and Concurrency. Prentice-Hall, 1989.
F. Moller and C. Tofts. A temporal calculus of communicating systems. In Proc. Concur 90, pages 401–415. Springer-Verlag, 1990. LNCS 458.
X. Nicollin and J. Sifakis. The algebra of timed processes ATP: Theory and application. Technical Report RT-C26, Laboratoire de Génie Informatique de Grenoble, 1990.
Vaughan Pratt et al. Modelling concurrency with partial orders. Concurrency mailing list, concurrency@theory.lcs.mit.edu, October 1990.
Gordon Plotkin. A structural approach to operational semantics. Technical Report DAIMI-FN-19, Computer Science Dept., Århus University, 1981.
G. M. Reed and A. W. Roscoe. Metric spaces as models for real-time concurrency. In Proc. 3rd Workshop on the Mathematical Foundations of Programming, pages 331–343. Springer-Verlag, 1987. LNCS 298.
S. A. Schneider. Communication and Correctness in Real-time Distributed Computing. D.Phil. thesis, Oxford University, 1990.
Steve Schneider. An operational semantics for timed CSP. In Proc. Chalmers Workshop on Concurrency. Dept. Computer Sciences, Chalmers University, 1991.
Scott A. Smolka and Bernhard Steffen. Priority as extremal probability. In Proc. Concur 90, pages 456–466. Springer Verlag, 1990. LNCS 458.
Chris Tofts. Relative frequency in a synchronous calculus. Technical report ECS-LFCS-90-108, LFCS, University of Edinburgh, 1990.
Wang Yi. Real-time behaviour of asynchronous agents. In Proc. Concur 90, pages 502–520. Springer-Verlag, 1990. LNCS 458.
Wang Yi. CCS + time = an interleaving model for real time systems. In J. Leach Albert, B. Monien, and M. Rodríguez, editors, Proc. ICALP 91, pages 217–228. Springer-Verlag, 1991. LNCS 510.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeffrey, A. (1991). Translating timed process algebra into prioritized process algebra. In: Vytopil, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1992. Lecture Notes in Computer Science, vol 571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55092-5_27
Download citation
DOI: https://doi.org/10.1007/3-540-55092-5_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55092-1
Online ISBN: 978-3-540-46692-5
eBook Packages: Springer Book Archive