Abstract
In this article we take a rather different view on models for real-time systems. First of all, transitions are not instantaneous. They really bear time changes. Secondly, the model is of geometric inspiration (following the ideas of [24]). It is intuitively clearer than other models in that executions can really be pictured as curves (or “trajectories”). Finally it is based on a model of true concurrency which can express scheduling properties (see [12]). We present the model in a very progressive way, starting from ordinary transition systems, then going through some truly concurrent operational models, to end up with a fully formalized model for real-time systems (with an application to a subset of timed CCS). The model (timed higher-dimensional automata or timed HDA in short) is made into a category where morphisms are simulations. It is shown to have many interesting algebraic (complete, co-complete, cartesian closed, monoidal closed) and computer-scientific properties (the timing laws are given naturally by the categorical combinators). A discussion of important matters such as fairness and Zeno is also provided.
Chapter PDF
References
S. Abramsky and T. Maibaum. Handbook of Logic in Computer Science, volume 1. Oxford Press, 1993.
L. Aceto and D. Murphy. On the ill-timed, but well-caused. In Proc. of CONCUR'93, number 715 in LNCS, pages 97–111. Springer-Verlag.
R. Alur and D. Dill. The theory of timed automata. In Proceedings of the REX Workshop, Real-Time: Theory in Practice, LNCS. Springer-Verlag, 1991.
A. Asperti and G. Longo. Categories, types and structures. The MIT Press, second edition, 1991.
H. Barringer, R. Kuiper, and A. Pnueli. A really abstract concurrent model and its temporal logic. In Proc. of the 13th POPL, pages 173–183. ACM Press, 1986.
M. A. Bednarczyk. Categories of asynchronous systems. PhD thesis, University of Sussex, 1988.
R. Cleaveland and A. Zwarico. A theory of testing for real-time. In Proceedings of LICS. IEEE Press, 1991.
P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixed points. Principles of Programming Languages 4, pages 238–252, 1977.
R. Cridlig and E. Goubault. Semantics and analyses of Linda-based languages. In Proc. of WSA '93, number 724 in LNCS. Springer-Verlag, 1993.
P. Gabriel and M. Zisman. Calculus fractions and homotopy theory. In Ergebnisse der Mathematik und ihrer Grenzgebiete, volume 35. Springer Verlag, 1967.
E. Goubault. Domains of higher-dimensional automata. In Proc. of CONCUR'93, Hildesheim, August 1993. Springer-Verlag.
E. Goubault. Schedulers as abstract interpretations of HDA. In Proc. of PEPM'95, La Jolla, June 1995. ACM Press.
E. Goubault. The Geometry of Concurrency. PhD thesis, Ecole Normale Supérieure, to appear, 1995.
E. Goubault and T. P. Jensen. Homology of higher-dimensional automata. In Proc. of CON-CUR'92, Stonybrook, New York, August 1992. Springer-Verlag.
T.A. Henzinger. The Temporal Specification and Verification of Real-time Systems. PhD thesis, Stanford University, 1991.
T.A. Henzinger, Z. Manna, and A. Pnueli. Timed transition systems. In Proc. of the REX Workshop, Real-Time: Theory in Practice, LNCS. Springer-Verlag, 1993.
P. Krishnan. A model for real-time systems. In Proc. of Mathematical Foundations of Computer Science, number 520 in LNCS. Springer-Verlag, 1991.
A.T. Lundell and S. Weingram. The Topology of CW-Complexes. Van Nostrand Reinhold Company, 1969.
A. Maggiolo-Schettini and J. Winkowski. Towards an algebra for timed behaviours. Theoretical Computer Science, 103:335–363.
J. P. May. Simplicial objects in algebraic topology. D. van Nostrand Company, inc, 1967.
F. Moller and C. Tofts. A temporal calculus of communicating systems. In Proceedings of CON-CUR'90, number 458 in LNCS. Springer-Verlag, 1990.
X. Nicollin and J. Sifakis. An overview and synthesis of timed process algebras. In Proc. of CAV'92, number 575 in LNCS, pages 376–398. Springer-Verlag, 1992.
G. Plotkin. Domains. Technical report, Computer Science Department, Edinbourgh, 1984.
V. Pratt. Modeling concurrency with geometry. In Proc. of the 18th ACM Symposium on Principles of Programming Languages. ACM Press, 1991.
G. M. Reed and A. W. Roscoe. Metric spaces as models for real-time concurrency. In Proc. of Mathematical Foundations of Programming Languages and Semantics, number 298 in LNCS, pages 331–343. Springer-Verlag, 1987.
H. Rund. The Differential Geometry of Finsler Spaces. Springer-Verlag, 1959.
M.W. Shields. Concurrent machines. Computer Journal, 28, 1985.
A. Stark. Concurrent transition systems. Theoretical Computer Science, 64:221–269, 1989.
R. van Glabbeek. Bisimulation semantics for higher dimensional automata. Technical report, Stanford University, 1991.
R. van Glabbeek and U. Goltz. Partial order semantics for refinement of actions. Bulletin of the EATCS, (34), 1989.
G. Winskel and M. Nielsen. Models for concurrency, volume 3 of Handbook of Logic in Computer Science, pages 100–200. Oxford University Press, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goubault, E. (1996). Durations for truly-concurrent transitions. In: Nielson, H.R. (eds) Programming Languages and Systems — ESOP '96. ESOP 1996. Lecture Notes in Computer Science, vol 1058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61055-3_36
Download citation
DOI: https://doi.org/10.1007/3-540-61055-3_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61055-7
Online ISBN: 978-3-540-49942-8
eBook Packages: Springer Book Archive