Tiles for Reo

Arbab, Farhad; Bruni, Roberto; Clarke, Dave; Lanese, Ivan; Montanari, Ugo

doi:10.1007/978-3-642-03429-9_4

Cited by 26 publications

(47 citation statements)

References 13 publications

(30 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this view, the source n and target m of a configuration s : n → m correspond to the interface of the connector. Since the interfaces p and q in diagram (14) may differ from n and m, the Tile Model provides a natural semantics for dynamic reconfiguration in Reo [19]. Bruni et al show that Petri nets with boundaries are equally expressive as BIP without priorities [20].…”

Section: Related Workmentioning

confidence: 99%

Combine and conquer: Relating BIP and Reo

Dokter

Jongmans

Arbab

et al. 2017

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

Coordination languages simplify design and development of concurrent systems. Particularly, exogenous coordination languages, like BIP and Reo, enable system designers to express the interactions among components in a system explicitly. A formal relation between exogenous coordination languages comprises the basis for a solid comparison and consolidation of their fundamental concepts. In this paper we establish a formal relation between BI(P) (i.e., BIP without the priority layer) and Reo, by defining transformations between their semantic models. We show that these transformations preserve all properties expressible in a common semantics. We use these transformations to define data-sensitive BIP architectures and their composition.

show abstract

Section: Related Workmentioning

confidence: 99%

Combine and conquer: Relating BIP and Reo

Dokter

Jongmans

Arbab

et al. 2017

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…Clarke et al [6] outline the difference between various models. Only connector colouring [8], Reo automata [6], intentional automata [10], and the tile model [3] capture context dependent behaviour. Connector colouring was the first to do so, and the others refine it in one way or another.…”

Section: Related Workmentioning

confidence: 99%

Partial Connector Colouring

Clarke

Proença

2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Connector colouring provided an intuitive semantics of Reo connectors which lead to effective implementation techniques, first based on computing colouring tables directly, and later on encodings of colouring into constraints. One weakness of the framework is that it operates globally, giving a colouring to all primitives of the connector in lock-step, including those not involved in the interaction. This global approach limits both scalability and the available concurrency. This paper addresses these problems by introducing partiality into the connector colouring model. Partial colourings allow parts of a connector to operate independently and in isolation, increasing scalability and concurrency.

show abstract

“…The model also captures context-dependent behaviour by propagating negative information about the absence of data flow through the connector. This model was extended to cover both state changes and the passing of data using tile logic [3]. Nonetheless, this model and its extension suffer from a number of problems.…”

Section: Formal Models Of Reomentioning

confidence: 99%

Automata for Context-Dependent Connectors

Bonsangue

Clarke

Silva

2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Recent approaches to component-based software engineering employ coordinating connectors to compose components into software systems. For maximum flexibility and reuse, such connectors can themselves be composed, resulting in an expressive calculus of connectors whose semantics encompasses complex combinations of synchronisation, mutual exclusion, non-deterministic choice and state-dependent behaviour. A more expressive notion of connector includes also contextdependent behaviour, namely, whenever the choices the connector can take change non-monotonically as the context, given by the pending activity on its ports, changes. Context dependency can express notions of priority and inhibition. Capturing context-dependent behaviour in formal models is non-trivial, as it is unclear how to propagate context information through composition. In this paper we present an intuitive automata-based formal model of context-dependent connectors, and argue that it is superior to previous attempts at such a model for the coordination language Reo.

show abstract

Tiles for Reo

Cited by 26 publications

References 13 publications

Combine and conquer: Relating BIP and Reo

Combine and conquer: Relating BIP and Reo

Partial Connector Colouring

Automata for Context-Dependent Connectors

Contact Info

Product

Resources

About