Modeling Urgency in Timed Systems

Bornot, Sébastien; Sifakis, Joseph; Tripakis, Stavros

doi:10.1007/3-540-49213-5_5

Cited by 109 publications

(96 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We will only discuss here some particular examples that have recurred on the works of Sifakis et al (see, e.g. [7,5,6]). We first focus on the guard: ⊕ = ∧.…”

Section: Discussionmentioning

confidence: 99%

“…Under min, a component may anticipate the future behaviour of the synchronising partner. In [7] and [6], the authors suggest that the intention of this synchronisation is that the earliest synchronising transition makes irrelevant the second one (e.g. a tramway leaves a crossing and after a while it signals to allow the change of the traffic light though it may be ignored if the light has already changed [6]).…”

Section: Discussionmentioning

confidence: 99%

“…Timed automata with deadlines (TAD for short) [24,7,5,6] were introduced to simplify the compositionality problem in timed systems, allowing also the modelling of soft real time systems. At the same time, the TAD model ensures, under reasonable assumption, what is called time reactivity in [6] and time lock freedom in [8], that is, whenever time progress stops there exists at least one transition enabled.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation

D’Argenio

Gebremichael

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Delaying the synchronisation of actions may reveal some hidden behaviour that would not happen if the synchronisation would meet the specified deadlines. This precise phenomenon makes bisimulation fail to be a congruence for the parallel composition of timed automata with deadlines, a variant of timed automata where time progress is controlled by deadlines imposed on each transition. This problem has been known and unsolved for several years. In this paper we give a characterisation of the coarsest congruence that is included in the bisimulation relation. In addition, a symbolic characterisation of such relation is provided and shown to be decidable. We also discuss the pitfalls of existing parallel compositions in this setting and argue that our definition is both reasonable and sufficiently expressive as to consider the modelling of both soft and hard real-time constraints.

show abstract

“…We will only discuss here some particular examples that have recurred on the works of Sifakis et al (see, e.g. [7,5,6]). We first focus on the guard: ⊕ = ∧.…”

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation

D’Argenio

Gebremichael

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Urgency allows to control time progress at the semantic level in a very general, flexible and compositional way [BST98,AGS00]. Formally, the urgency of all outgoing transitions of a (global) system state, impose the following restriction on possible time progress in s: at time point t, waiting is possible for a duration δ, as long as the Time Progress Condition…”

Section: Time In Semantic Modelsmentioning

confidence: 99%

Expression of Time and Duration Constraints in SDL

Graf

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. in this paper we give an overview on a set of time related features, useful in the context of real-time system design and classify them into two categories, those needed for modeling of non functional aspects and analysis, and those needed for functional design. We are careful to allow a clear distinction between functional and non functional parts of a specification. We show how these features are represented at the semantic level with a minimal number of primitives.

show abstract

“…As an alternative to urgency preserving semantics, exible composition semantics have been studied BST97,BS98]. This semantics preserve time reactivity.…”

Section: Composition Of Timed Systemsmentioning

confidence: 99%