Abstract
Timed concurrent systems are widely used in concurrent and distributed real-time software, modeling of hybrid systems, design of hardware systems (using hardware description languages), discrete-event simulation, and modeling of communication networks. They consist of concurrent components that communicate using timed signals, that is, sets of (semantically) time-stamped events. The denotational semantics of such systems is traditionally formulated in a metric space, wherein causal components are modeled as contracting functions. We show that this formulation excessively restricts the models of time that can be used. In particular, it cannot handle super-dense time, commonly used in hardware description languages and hybrid systems modeling, finite time lines, and time with no origin. Moreover, if we admit continuous-time and mixed signals (essential for hybrid systems modeling) or certain Zeno signals, then causality is no longer equivalent to its formalization in terms of contracting functions. In this paper, we offer an alternative semantic framework using a generalized ultrametric that overcomes these limitations.
This is a preview of subscription content, log in via an institution to check access.
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
Abadi, M., Lamport, L.: An old-fashioned recipe for real time. ACM Trans. Program. Lang. Syst. 16(5), 1543–1571 (1994)
Arnold, A., Nivat, M.: Metric interpretations of infinite trees and semantics of non deterministic recursive programs. Fundamenta Informaticae 11(2), 181–205 (1980)
Aronszajn, N., Panitchpakdi, P.: Extension of uniformly continuous transformations and hyperconvex metric spaces. Pacific Journal of Mathematics 6(3), 405–439 (1956)
Baier, C., Majster-Cederbaum, M.E.: Denotational semantics in the cpo and metric approach. Theoretical Computer Science 135(2), 171–220 (1994)
Calude, C.S., Marcus, S., Staiger, L.: A topological characterization of random sequences. Information Processing Letters 88(5), 245–250 (2003)
de Bakker, J.W., de Vink, E.P.: Denotational models for programming languages: Applications of Banach’s fixed point theorem. Topology and its Applications 85, 35–52 (1998)
Granas, A., Dugundji, J.: Fixed Point Theory. Springer, Heidelberg (2003)
Gupta, V., Jagadeesan, R., Panangaden, P.: Approximate reasoning for real-time probabilistic processes. In: Proceedings of the First International Conference on the Quantitative Evaluation of Systems (QEST 2004), September 2004, pp. 304–313 (2004)
Hitzler, P., Seda, A.K.: Generalized metrics and uniquely determined logic programs. Theoretical Computer Science 305(1-3), 187–219 (2003)
Kapur, A.: Interval and Point-Based Approaches to Hybrid Systems Verification. Ph.d., Stanford University, Uses super dense time (super-dense, superdense) (1997)
Lee, E.A.: Modeling concurrent real-time processes using discrete events. Annals of Software Engineering 7, 25–45 (1999)
Lee, E.A., Sangiovanni-Vincentelli, A.: A framework for comparing models of computation. IEEE Transactions on CAD 17(12) (1998)
Lee, E.A., Varaiya, P.: Structure and Interpretation of Signals and Systems. Addison-Wesley, Reading (2003)
Lee, E.A., Zheng, H.: Operational Semantics of Hybrid Systems. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 25–53. Springer, Heidelberg (2005)
Lee, E.A., Liu, J.: On the Causality of Mixed-Signal and Hybrid Models. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol. 2623, pp. 328–342. Springer, Heidelberg (2003)
Liu, X.: Semantic foundation of the tagged signal model. Phd thesis, EECS Department, University of California (December 20, 2005)
Liu, X., Matsikoudis, E., Lee, E.A.: Modeling timed concurrent systems using generalized ultrametrics. Technical Report UCB/EECS-2006-45. EECS Department, University of California, Berkeley (May 1, 2006)
Maler, O., Manna, Z., Pnueli, A.: From timed to hybrid systems. In: Real-Time: Theory and Practice, REX Workshop, pp. 447–484. Springer, Heidelberg (1992)
Manna, Z., Pnueli, A.: Verifying hybrid systems. Hybrid Systems, 4–35 (1992)
Naundorf, H.: Strictly causal functions have a unique fixed point. Theoretical Computer Science 238(1-2), 483–488 (2000)
Priess-Crampe, S., Ribenboim, P.: Logic programming and ultrametric spaces. Rendiconti di Matematica, Serie VII 19, 155–176 (1999)
Priess-Crampe, S., Ribenboim, P.: Fixed point and attractor theorems for ultrametric spaces. Forum Mathematicum 12, 53–64 (2000)
Reed, G.M., Roscoe, A.W.: Metric spaces as models for real-time concurrency. In: 3rd Workshop on Mathematical Foundations of Programming Language Semantics, London, UK, pp. 331–343 (1988)
van Breugel, F.: Comparative semantics for a real-time programming language with integration. In: Abramsky, S. (ed.) CAAP 1991 and TAPSOFT 1991. LNCS, vol. 493, pp. 397–411. Springer, Heidelberg (1991)
Yates, R.K.: Networks of real-time processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715. Springer, Heidelberg (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, X., Matsikoudis, E., Lee, E.A. (2006). Modeling Timed Concurrent Systems. In: Baier, C., Hermanns, H. (eds) CONCUR 2006 – Concurrency Theory. CONCUR 2006. Lecture Notes in Computer Science, vol 4137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11817949_1
Download citation
DOI: https://doi.org/10.1007/11817949_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37376-6
Online ISBN: 978-3-540-37377-3
eBook Packages: Computer ScienceComputer Science (R0)