On the Composition of Hybrid Systems

Bornot, Sébastien; Sifakis, Joseph

doi:10.1007/978-3-642-59615-5_14

Cited by 12 publications

(29 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Assuming Timeout is started at time t, it should generate a timeout action at a time t+D if and only if the action good has not already occured. Thus, if action timeout occurs, it must occur exactly at time t+D 3 Our presentation here is similar to that in 6] 2. Urgency of good action.…”

Section: A Bounded Timeoutmentioning

confidence: 83%

“…= b? (3) In addition, we let v, v 0 etc, range over vectors of processes, which are written, < l 1 ; :::; l n >, jvj denotes the length of the vector, we use a substitution notation as follows: < l 1 ; :::; l j ; :::; l n > l=l j ] =< l 1 ; :::; l j 1 ; l; l j+1 ; :::; l n > and we write v l The form that such constraints can take is typically limited, however since we are not considering veri cation this is not an issue for us. …”

Section: Timed Automatamentioning

confidence: 99%

See 1 more Smart Citation

Modelling Timeouts without Timelocks

Bowman

1999

Formal Methods for Real-Time and Probabilistic Systems

View full text Add to dashboard Cite

Abstract. We address the issue of modelling a simple timeout in timed automata. We argue that expression of the timeout in the UPPAAL timed automata model is unsatisfactory. Speci cally, the solutions we explore either allow timelocks or are prohibitively complex. In response we consider timed automata with deadlines which have the property that timelocks cannot be created when composing automata in parallel. We explore a number of di erent options for reformulating the timeout in this framework and then we relate them.

show abstract

Section: A Bounded Timeoutmentioning

confidence: 83%

Section: Timed Automatamentioning

confidence: 99%

Modelling Timeouts without Timelocks

Bowman

1999

Formal Methods for Real-Time and Probabilistic Systems

View full text Add to dashboard Cite

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%

“…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%

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

“…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%