CONCUR 2006 – Concurrency Theory

Volume 4137 of the series Lecture Notes in Computer Science pp 1-15

Modeling Timed Concurrent Systems

  • Xiaojun LiuAffiliated withSun Microsystems, Inc.
  • , Eleftherios MatsikoudisAffiliated withUniversity of California
  • , Edward A. LeeAffiliated withUniversity of California

* Final gross prices may vary according to local VAT.

Get Access


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.