## Models and Temporal Logics for Timed Component Connectors (2004)

### Cached

### Download Links

- [www.inf.tu-dresden.de]
- [web.informatik.uni-bonn.de]
- [www.cwi.nl]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proc. SEFM’04. IEEE CS |

Citations: | 15 - 7 self |

### BibTeX

@INPROCEEDINGS{Arbab04modelsand,

author = {Farhad Arbab and Christel Baier and Frank De Boer and Jan Rutten},

title = {Models and Temporal Logics for Timed Component Connectors},

booktitle = {In Proc. SEFM’04. IEEE CS},

year = {2004},

publisher = {Press}

}

### OpenURL

### Abstract

The coordination language Reo supports compositional system construction through connectors with real-time properties that exogenously coordinate the interactions among the constituent components into a coherent collaboration. In this paper, we present an operational semantics for the channel-based component connectors of Reo in terms of Timed Constraint Automata and introduce a temporal-logic for specification and verification of their real-time properties.

### Citations

3384 |
Communication and Concurrency
- Milner
- 1989
(Show Context)
Citation Context ...ternating Bit Protocol) We consider a variant of the ABP where two components (the sender and the receiver) are connected via lossy synchronous channels. We follow here essentially the description in =-=[24]-=- but do not assume unreliable channels that may lose data in an unpredictable way. Instead, we assume lossy synchronous channels (as in Reo, see Section 3) where a data item written to the source end ... |

2139 | A Theory of Timed Automata
- Alur, Dill
- 1994
(Show Context)
Citation Context ...ional model for Reo connector circuits, we use timed constraint automata (TCA) which extend their untimed version [4] with the concepts borrowed from classical timed automata with location invariants =-=[1, 10]-=-. TCA have two kinds of transitions: (1) internal changes of the locations caused by some time constraints and (2) transitions that represent the synchronized execution of I/Ooperations at some of the... |

1584 |
The Temporal Logic of Reactive and Concurrent Systems. Specifications
- Manna, Pnueli
- 1992
(Show Context)
Citation Context ...ed data streams as in [8, 7], comprising a formalization of the possible data-flow at each node over time. To specify a desired coordination mechanism, we use a variant of linear temporal logic (LTL) =-=[25, 22]-=- with real-time constraints, which we call timed scheduled-data-stream logic (TSDSL) and has a semantics based on timed data streams. TSDSL essentially relies on a combination of the time-abstract tem... |

1287 |
The temporal logic of programs
- Pnueli
- 1977
(Show Context)
Citation Context ...ed data streams as in [8, 7], comprising a formalization of the possible data-flow at each node over time. To specify a desired coordination mechanism, we use a variant of linear temporal logic (LTL) =-=[25, 22]-=- with real-time constraints, which we call timed scheduled-data-stream logic (TSDSL) and has a semantics based on timed data streams. TSDSL essentially relies on a combination of the time-abstract tem... |

545 | UPPAAL in a nutshell
- KG, Pettersson, et al.
(Show Context)
Citation Context ...es of basic channel types. One conceptual difference between TCA and classical timed automata is the treatment of immediate actions or urgent synchronous channels, as they are used e.g., in the tools =-=[20, 17, 32]-=-. The assumption that synchronous I/O-operations must be executed as soon as they become enabled makes no sense in our framework. For instance, assume that we have a FIFO channel carrying data from no... |

507 | Symbolic Model Checking for Real-Time Systems
- Henzinger, Nicollin, et al.
- 1992
(Show Context)
Citation Context ...ional model for Reo connector circuits, we use timed constraint automata (TCA) which extend their untimed version [4] with the concepts borrowed from classical timed automata with location invariants =-=[1, 10]-=-. TCA have two kinds of transitions: (1) internal changes of the locations caused by some time constraints and (2) transitions that represent the synchronized execution of I/Ooperations at some of the... |

383 | Hytech: A model checker for hybrid systems
- Henzinger, Ho, et al.
- 1997
(Show Context)
Citation Context ...es of basic channel types. One conceptual difference between TCA and classical timed automata is the treatment of immediate actions or urgent synchronous channels, as they are used e.g., in the tools =-=[20, 17, 32]-=-. The assumption that synchronous I/O-operations must be executed as soon as they become enabled makes no sense in our framework. For instance, assume that we have a FIFO channel carrying data from no... |

372 |
Propositional Dynamic Logic of Regular Programs
- Fischer, Ladner
- 1979
(Show Context)
Citation Context ...lity ○ (next step), 13sTSDSL uses formulas of the type 〈α〉ϕ which consist of a so-called timed scheduled-data expression α and aformulaϕ. Thistypeofformulas is inspired by propositional dynamic logic =-=[12]-=- and extended temporal logic [29]. The timed scheduled-data expressions are variants of timed regular expressions [9] built from atoms of the form 〈N,dc〉. TheTSDexpressions specify sets of finite TSD ... |

284 | Simple on-the-fly automatic verification of linear temporal logic
- Gerth, Peled, et al.
- 1995
(Show Context)
Citation Context ..., we switch from ϕ to ¬ϕ which we regard as a formula of (untimed) LTL with action labels. Here, 〈α〉 is treated as a next step operator with the label α. Then, we may apply standard techniques, e.g., =-=[30, 15, 27, 13]-=-, modified for the action-labeled case, to construct a nondeterministic Büchi automaton B for ¬ϕ, whosetransitions are labeled with the expressions α that occur in sub-formulas 〈α〉ψ of ϕ. We now turn ... |

255 | A really temporal logic
- Alur, Henzinger
- 1994
(Show Context)
Citation Context ...low for ω-regular TSD expressions that result from adding an ω-operator. Although this increases expressiveness, we skip this option here. In contrast to the real-time extensions of LTL, as, e.g., in =-=[16, 3, 2]-=-, TSDSL does not use time-constrained temporal modalities such as U ≤t .These can be added to TSDSL, but in the examples (see below) it turned out that the time-constraints in the TSD expressions are ... |

216 | The bene of relaxing punctuality
- Alur, Feder, et al.
- 1996
(Show Context)
Citation Context ...low for ω-regular TSD expressions that result from adding an ω-operator. Although this increases expressiveness, we skip this option here. In contrast to the real-time extensions of LTL, as, e.g., in =-=[16, 3, 2]-=-, TSDSL does not use time-constrained temporal modalities such as U ≤t .These can be added to TSDSL, but in the examples (see below) it turned out that the time-constraints in the TSD expressions are ... |

171 | Reo: a channel-based coordination model for component composition
- Arbab
(Show Context)
Citation Context ...n of their real-time properties. 1. Introduction The task of designing a complex concurrent system with several components requires a coordination model that formalizes their mutual interactions. Reo =-=[3]-=- offers a powerful language for implementation of coordinating component connectors based on a calculus of mobile channels. In this paper, we consider the real-time aspects of Reo when the behavior sp... |

160 | A model for communicating sequential processes
- Brookes
- 1983
(Show Context)
Citation Context ...ng about (design and analysis of) channel-based coordination mechanisms, based on their data-flow. Although compositionality in timed Reo and TCA is in the spirit of real-time process algebras, e.g., =-=[13, 16]-=-, Reo focusses on composition of connectors out of a variety of basic channel types. Organization of the paper. Timed constraint automata are introduced in Section 2. In Section 3 we explain the main ... |

122 | Fast LTL to Buchi Automata Translation
- Gastin, Oddoux
- 2001
(Show Context)
Citation Context ..., we switch from ϕ to ¬ϕ which we regard as a formula of (untimed) LTL with action labels. Here, 〈α〉 is treated as a next step operator with the label α. Then, we may apply standard techniques, e.g., =-=[30, 15, 27, 13]-=-, modified for the action-labeled case, to construct a nondeterministic Büchi automaton B for ¬ϕ, whosetransitions are labeled with the expressions α that occur in sub-formulas 〈α〉ψ of ϕ. We now turn ... |

110 | Efficient Büchi automata from LTL formulae
- Somenzi, Bloem
- 2000
(Show Context)
Citation Context ..., we switch from ϕ to ¬ϕ which we regard as a formula of (untimed) LTL with action labels. Here, 〈α〉 is treated as a next step operator with the label α. Then, we may apply standard techniques, e.g., =-=[30, 15, 27, 13]-=-, modified for the action-labeled case, to construct a nondeterministic Büchi automaton B for ¬ϕ, whosetransitions are labeled with the expressions α that occur in sub-formulas 〈α〉ψ of ϕ. We now turn ... |

92 | Timed interfaces
- Alfaro, Henzinger, et al.
- 2002
(Show Context)
Citation Context ...nd explain the relation of TSDSL with refinement relations. Related models. There are several other related real-time models that also focus on aspects of coordination. Timed interface automata (TIA) =-=[8]-=- or real-time variants of I/Oautomata, e.g., [12, 9, 11], are related to TCA in the same way as their untimed versions. I/O-automata rely on the assumption of input-enabledness which is not required (... |

87 | Liveness in timed and untimed systems
- Segala, Gawlick, et al.
- 1998
(Show Context)
Citation Context ... relations. Related models. There are several other related real-time models that also focus on aspects of coordination. Timed interface automata (TIA) [8] or real-time variants of I/Oautomata, e.g., =-=[12, 9, 11]-=-, are related to TCA in the same way as their untimed versions. I/O-automata rely on the assumption of input-enabledness which is not required (and would not make sense) in constraint automata. The ma... |

77 |
Reasoning about infinite computation paths
- Wolper, Vardi, et al.
- 1983
(Show Context)
Citation Context |

70 | Modeling component connectors in Reo by constraint automata
- Baier, Sirjani, et al.
(Show Context)
Citation Context ... (unless, of course, it is dispensed through its sink in the meanwhile). As the operational model for Reo connector circuits, we use timed constraint automata (TCA) which extend their untimed version =-=[4]-=- with the concepts borrowed from classical timed automata with location invariants [1, 10]. TCA have two kinds of transitions: (1) internal changes of the locations caused by some time constraints and... |

69 |
CCS + time = an interleaving model for real time systems
- Yi
- 1991
(Show Context)
Citation Context ...ng about (design and analysis of) channel-based coordination mechanisms, based on their data-flow. Although compositionality in timed Reo and TCA is in the spirit of real-time process algebras, e.g., =-=[13, 16]-=-, Reo focusses on composition of connectors out of a variety of basic channel types. Organization of the paper. Timed constraint automata are introduced in Section 2. In Section 3 we explain the main ... |

65 |
Decidability of bisimulation equivalences for parallel timer processes
- Cerans
- 1993
(Show Context)
Citation Context ...rmulas. A sufficient decidable criterion for checking (TSDLS- or) language-equivalence of two TCA is to switch to a coarser equivalence corresponding to timed bisimulation for ordinary timed automata =-=[7]-=-. In our setting, a timed bisimulation for a TCA T is the coarsest equivalence ∼ on the state space Q of the induced state-transition graph AT such that for all q1, q2 ∈ Q with q1 ∼ q2 and all N ⊆ N ,... |

63 | A coinductive calculus of component connectors
- Arbab, Rutten
- 2002
(Show Context)
Citation Context ...on TCA that model Reo’s operators join and hide to build complex connectors out of instances of basic channel types. The semantics of the TCA and timed Reo circuits relies on timed data streams as in =-=[5, 4]-=-, comprising a formalization of the possible data-flow at each node over time. To specify a desired coordination mechanism, we use a variant of linear temporal logic (LTL) with real-time constraints, ... |

63 |
Explicit-clock temporal logic
- Harel, Lichtenstein, et al.
- 1990
(Show Context)
Citation Context ...low for ω-regular TSD expressions that result from adding an ω-operator. Although this increases expressiveness, we skip this option here. In contrast to the real-time extensions of LTL, as, e.g., in =-=[16, 3, 2]-=-, TSDSL does not use time-constrained temporal modalities such as U ≤t .These can be added to TSDSL, but in the examples (see below) it turned out that the time-constraints in the TSD expressions are ... |

56 | Orna Kupferman. Alternatingtime temporal logic - Alur, Henzinger |

54 | Timed regular expressions
- Asarin, Caspi, et al.
(Show Context)
Citation Context ...uled-data-stream logic (TSDSL) and has a semantics based on timed data streams. TSDSL essentially relies on a combination of the time-abstract temporal modalities in LTL and timed regular expressions =-=[6]-=-. We show through a series of examples how TSDSL can serve as a specification formalism for (timed) Reo circuits, sketch the ideas of a model checking algorithm, and explain the relation of TSDSL with... |

40 | Verifying abstractions of timed systems
- Tasiran, Alur, et al.
- 1996
(Show Context)
Citation Context ...L formulas in the sense that if q1 � q2 and q2 |= ϕ then q1 |= ϕ. The question of whether one state of a TCA simulates another one can be answered with the help of the region graph construction as in =-=[14]-=-. 5. Conclusion In this paper, we introduced a formal model to reason about timing constraints for Reo component connectors. We presented composition operators for join and hiding that can serve as a ... |

27 |
An enhanced version of timed LOTOS and its application to a case study
- Leonard, Leduc
- 1994
(Show Context)
Citation Context ...lows to check a-posteriori whether a design makes the components work together in the desired way. Although compositionality in timed Reo and TCA is in the spirit of real-time process algebras, e.g., =-=[26, 31, 21]-=-, Reo’s philosophy of composing connectors out of a variety of basic channel types via join and hiding and supporting any kind of synchronous or asynchronous communication differs from classical proce... |

13 |
Kronos: A Verification Tool for Real-time Systems, Software Tools for Technology Transfer 1, 123–133
- Yovine
- 1997
(Show Context)
Citation Context ...es of basic channel types. One conceptual difference between TCA and classical timed automata is the treatment of immediate actions or urgent synchronous channels, as they are used e.g., in the tools =-=[20, 17, 32]-=-. The assumption that synchronous I/O-operations must be executed as soon as they become enabled makes no sense in our framework. For instance, assume that we have a FIFO channel carrying data from no... |

12 |
Specification and synthesis of communicating processes using an extended temporal logic
- Wolper
- 1982
(Show Context)
Citation Context ...ormulas of the type 〈〈α〉〉ϕ which consist of a so-called timed scheduled-data expression α and a formula ϕ. This type of formulas is inspired by propositional dynamic logic and extended temporal logic =-=[15]-=-. The timed scheduled-data expressions are variants of timed regular expressions [6] built from atoms of the form 〈N,dc〉. The TSD expressions specify sets of finite TSD streams. The intuitive meaning ... |

4 |
A framework for modelling timed systems with restricted hybrid automata
- Kaynar, Lynch, et al.
- 2003
(Show Context)
Citation Context ... relations. Related models. There are several other related real-time models that also focus on aspects of coordination. Timed interface automata (TIA) [8] or real-time variants of I/Oautomata, e.g., =-=[12, 9, 11]-=-, are related to TCA in the same way as their untimed versions. I/O-automata rely on the assumption of input-enabledness which is not required (and would not make sense) in constraint automata. The ma... |

3 | Time-constrained automata (extended abstract
- Merritt, Modugno, et al.
- 1991
(Show Context)
Citation Context ... relations. Related models. There are several other related real-time models that also focus on aspects of coordination. Timed interface automata (TIA) [8] or real-time variants of I/Oautomata, e.g., =-=[12, 9, 11]-=-, are related to TCA in the same way as their untimed versions. I/O-automata rely on the assumption of input-enabledness which is not required (and would not make sense) in constraint automata. The ma... |

1 |
Modeling context-senstive behaviors of component connectors with priorities. Forthcoming paper
- Arbab, Baier, et al.
- 2004
(Show Context)
Citation Context ...l the context-sensitive behavior of a lossy channel where the {A}-transition is impossible if B is 7sready to synchronize, the concept of priorities can be used as we explain in the forthcoming paper =-=[6]-=-. More exotic channels permitted in Reo include the synchronous drain that has two source ends. Because adrain has no sink end, no data value can ever be obtained from this channel. Thus, all data acc... |