Abstract
During the last few years various process calculi have been extended to include real-time in order to handle quantitative aspects of real-time systems, for instance that some critical event must not or should happen within a certain time period. A number of extensions of classical process calculi with explicit timing constraints has emerged in the last few years. We mention the calculi defined in [Wan90] and in [Che91], all being extensions of CCS [Mi189], and the ones defined in [NSY91] and [BB89]. Common to these real-time calculi is that time is represented by some dense time domain, e.g. as in this paper the non-negative reals. Other timed calculi based on discrete time include [NRSV90, DS89, HR91].
TFL is the Danish telecommunication research laboratory.
Address:Dep. of Math. and Comp. Sc., Aalborg University, Fredrik Bajers Vej 7, 9220 Aalborg, Denmark. This work has been supported by the Danish Research Council through the DART project. The first author is supported by a scholarship from Aalborg University.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Rajeev Alur, Costas Courcoubetis, and David Dill. Model-checking for real-time systems. In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, 1990.
Rajeev Alur and David Dill. Automata for modelling real-time systems. In Automata, Languages and Programming: Proceedings of the 17th ICALP, LNCS 443. Springer-Verlag, 1990.
J.C.M. Baeten and J.A. Bergstra. Real time process algebra. Tech-nical Report P8916, University of Amsterdam, 1989.
Liang Chen. An interleaving model for real-time systems. Technical report, LFCS, University of Edinburgh, Scotland, 1991. Preliminary version.
D.L. Dill. Timing assumptions and verification of finite-state con-current systems. Lecture Notes in Computer Science, 407, 1989.
Jim Davis and Steve Schneider. An introduction to timed CSP. Technical Report PRG-75, Oxford University Computing Laboratory, 1989.
Jens Chr. Godskesen and Kim G. Larsen. Real-time calculi and ex-pansion theorems. In Twelfth Conference on the FST and TCS, Lecture Notes in Computer Science. Springer-Verlag, December 1992. To appear.
Uno Holmer, Kim Larsen, and Yi Wang. Deciding properties of regular timed processes. In Kim G. Larsen and Arne Skou, editors, Proceedings of the Third Workshop on Computer Aided Verification„ volume 575 of Lecture Notes in Computer Science. Springer-Verlag, 1991.
Matthew Hennessy and Tim Regan. A process algebra for timed systems. Technical Report 5/91, University of Sussex, 1991.
Robin Milner. Communication and Concurrency. Series in Com-puter Science. Prentice-Hall International, 1989.
Faron Moller and Chris Tofts. A temporal calculus of communi-cating systems. In CONCUR’90, volume 458 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
X. Nicollin, J.-L. Richier, Joseph Sifakis, and J. Voiron. ATP: an algebra for timed processes. In Proceedings of the IFIP TC 2 Working Conference on Programming Concepts and Methods, Sea of Gallilee, Israel, April 1990.
Xavier Nicollin, Joseph Sifakis, and Sergio Yovine. From ATP to timed graphs and hybrid systems. In Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science. Springer-Verlag, 1991.
Kârlis Cerâns. Decidability of bisimulation equivalences for pro-cesses with parallel timers. To appear in Proceedings of CAV’92, 1992.
Yi Wang. Real-time behaviour of asynchronous agents. In CONCUR ‘80, volume 458 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
Yi Wang. A Calculus of Real Time Systems. PhD thesis, Chalmers University of Technology, GSteborg, Sweden, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 British Computer Society
About this paper
Cite this paper
Godskesen, J.C., Larsen, K.G. (1993). Real-Time Calculi and Expansion Theorems. In: Purushothaman, S., Zwarico, A. (eds) NAPAW 92. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3217-2_1
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3217-2_1
Publisher Name: Springer, London
Print ISBN: 978-3-540-19822-2
Online ISBN: 978-1-4471-3217-2
eBook Packages: Springer Book Archive