A. Maggiolo-Schettini and J. Winkowski. Towards an algebra for timed behaviours. Th. Comp. Sci., 103:335--363, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....a (non standard) fixed point semantics based on an advanced form of timed refusals in order to deal with divergence. Both works consider an interleaving semantics. Timed extensions of partial order models have received scant attention in the literature. For example, extensions of configurations [30], prime event structures [32] posets [21] and higher dimensional automata [20] do exist, but these models have not been used as a semantic model for a timed process algebra and are merely of theoretical interest. Murphy [32] uses time truncation in a similar way as we do as a basis for ....

A. Maggiolo-Schettini and J. Winkowski. Towards an algebra for timed behaviours. Th. Comp. Sci., 103:335--363, 1992.

....our first preorder is essentially that of [7] Finally, we mention also a temporal model based on continuous time [15] where higher order transitions and computations are given a geometric description. Temporal extensions of process algebra not directly related to our proposal may be found in [23, 24, 3, 21, 16, 17, 18]. A survey of these approaches can be found in [22] Many other models for timed behaviours have been proposed in the literature, e.g. those based on Kripke structures, automata, temporal logics. We do not discuss them here and we refer the interested reader to for instance the proceedings of ....

Andrea Maggiolo-Schettini and J'ozef Winkowski. Towards an algebra for timed behaviours. Theeoretical Computer Science, 103(2):335--363, 1992.

....to LOTOS [5] This formalism includes a timed action prefix operator which constraints the occurrence time of actions, and a timeout and watchdog (i.e. timed interrupt) operator. The inclusion of time in partial order models is not new: e.g. extensions are known of pomsets [8] configurations [18], fand; org automata [12] sets of posets [13] and event structures [20] The timed extension of causal trees [10] resembles our model. We are, however, unaware of any proposal that incorporates time, timeouts, and watchdogs in a partial order setting. These ingredients are considered to be ....

A. Maggiolo-Schettini and J. Winkowski. Towards an algebra for timed behaviours. Theoretical Computer Science, 103:335--363, 1992.

....this constitutes the first timed causality based model incorporating urgent and non urgent actions. A few timed extensions of causalitybased models do exist. For the sake of brevity we just briefly mention them here. 13] describes an interesting real time extension of CCS based on causal trees. [23] considers a theoretical model, called timed configurations, where all events are treated to be urgent. 26] treats a timed extension of event structures in which events have a duration and all are urgent. 16] introduce a real time process language consisting of simple sequential processes that ....

A. Maggiolo-Schettini and J. Winkowski. Towards an algebra for timed behaviours. Theor. Comp. Sci. 103:335--363 (1992)

....be eliminated. We believe that true concurrency models, like event structures, are more natural to include a notion of real time, by the explicit presence or absence of a causal relation between actions. A few extensions of true concurrency models are known to us that incorporate time (e.g. [7, 19, 22]) Fidge [7] describes a realtime extension of CCS based on causal trees. Maggiolo Schettini Winkowski [19] consider a theoretical model, called timed configurations, where all timed events are treated to be urgent. Murphy [22] treats a timed extension of event structures in which events have a ....

....of real time, by the explicit presence or absence of a causal relation between actions. A few extensions of true concurrency models are known to us that incorporate time (e.g. 7, 19, 22] Fidge [7] describes a realtime extension of CCS based on causal trees. Maggiolo Schettini Winkowski [19] consider a theoretical model, called timed configurations, where all timed events are treated to be urgent. Murphy [22] treats a timed extension of event structures in which events have a duration, rather than having relative delays between events. To our knowledge, the approach we present in ....

A. Maggiolo-Schettini and J. Winkowski. Towards an algebra for timed behaviours. Theoretical Computer Science, 103:335--363, 1992.

....structures are more expressive than prime, but are incomparable with flow and stable event structures. Time in partial order models Timed extensions of partial order models have received scant attention in the literature. Extensions of pomsets (partially ordered multi sets) 16] configurations [58], prime event structures [62] posets [45] fand, org automata [34] and higher dimensional automata [33] are known to us, but these models have not been used as a semantic model for a timed process algebra and are merely of theoretical interest. Our approach resembles that of [24] 24] proposes a ....

A. Maggiolo-Schettini and J. Winkowski. Towards an algebra for timed behaviours. Th. Comp. Sci., 103:335--363, 1992.

....to the classical one) the flexibility of the specification language and to be suitable for investigating structural transformations. A version in denotational style of the proposed semantics can be found in [13] In that case, the chosen semantical domain, namely, Timed Configuration Systems (see [10]) allows to exploit the large number of equivalence studied in this domain for defining a wide range of different behaviour preservation notions. In such mathematical framework the original semantics of statecharts and the one proposed here can be formally compared also with respect to the ....

Maggiolo-Schettini, A., Winkowski, J.: Towards an Algebra for Timed Behaviours, Theoretical Computer Science 103 (1992), pp. 335--363.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC