Partial Connector Colouring

Clarke, Dave; Proença, José

doi:10.1007/978-3-642-30829-1_5

Cited by 8 publications

(13 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For his PhD thesis [60], Proença developed the first implementation based on these ideas, demonstrated its merit through benchmarks, and invented a new automaton model to reason about split connectors [58,59]. Furthermore, Clarke and Proença explored connector splitting in the context of the connector coloring semantics [18]. They discovered that the standard version of that semantics has undesirable properties in the context of splitting: some split connectors that intuitively should be equivalent to the original connector are not equivalent under the standard version.…”

Section: Reomentioning

confidence: 99%

Partially distributed coordination with Reo and constraint automata

Jongmans

Santini

Arbab

2015

SOCA

View full text Add to dashboard Cite

Coordination languages, such as Reo, have emerged for the specification and implementation of interaction protocols among concurrent entities, manifested as connectors. In this paper, we describe a theoretical justification and a practical proof-of-concept tool for automatically generating partially distributed, partially centralized implementations of Reo connectors. Such implementations have three performance advantages: faster compilation at build time (compared to a purely centralized approach), reduced latency at run time (compared to a purely distributed approach), and improved parallelism at run time (compared to a purely centralized approach). Our theory relies on the definition of a new product operator on constraint automata (Reo's formal semantics), which we use to formally justify distributions of disjoint parts of a coordination scheme over different machines according to several possible motivations (e.g., performance, QoS constraints, privacy, resource availability, and network topology). To exemplify our work, in a case study, we show and explain how a generated connector implementation can be executed.

show abstract

Section: Reomentioning

confidence: 99%

Partially distributed coordination with Reo and constraint automata

Jongmans

Santini

Arbab

2015

SOCA

View full text Add to dashboard Cite

show abstract

“…The resulting code has an exponential number of formulas, without data transformations, that are checked sequentially. Interaction constraints improved on these implementations by exploiting the flexibility of constraints-again, limited only by the underlying solver-, and by permitting constraints to change dynamically and to be evaluated concurrently and partially, thereby increasing scalability as well [10].…”

Section: The Need For Interactionmentioning

confidence: 99%

Interactive Interaction Constraints

Proença

Clarke

2013

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Interaction constraints are an expressive formalism for describing coordination patterns, such as those underlying the coordination language Reo, that can be efficiently implemented using constraint satisfaction technologies such as SAT and SMT solvers. Existing implementations of interaction constraints interact with external components only in a very simple way: interaction occurs only between rounds of constraint satisfaction. What is missing is any means for the constraint solver to interact with the external world during constraint satisfaction. This paper introduces interactive interaction constraints which enable interaction during constraint satisfaction, and in turn increase the expressiveness of coordination languages based on interaction constraints by allowing a larger class of operations to be considered to occur atomically. We describe how interactive interaction constraints are implemented and detail a number of strategies for guiding constraint solvers. The benefit of interactive interaction constraints is illustrated using two examples, a hotel booking system and a system of transactions with compensations. From a general perspective, our work describes how to open up and exploit constraint solvers as the basis of a coordination engine.

show abstract

“…The Peer Model can now be started with Promela's run operation calling startPeer() Fig. 1 from [4] which starts the wirings of all peers as concurrently running processes. For each wiring multiple instances are assumed to exist concurrently (cf.…”

Section: Meta Model and Domain Specific Languagementioning

confidence: 99%

“…An approach related to Split/Join has been undertaken with Reo [4] termed Synchronous Merge Connector (see Figure 7). Flows are modeled by means of different connector types.…”

Section: Related Workmentioning

confidence: 99%

Peer-Based Programming Model for Coordination Patterns

Kühn

Craß

Joskowicz

et al. 2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Modern distributed software systems must integrate in neartime parallel processes and heterogeneous information sources provided by active, autonomous software systems. Such lively information sources are e.g. sensory data, weather data, traffic data, or booking data, operated by independent distributed sites. The complex integration requires the coordination of these data flows to guarantee consistent global semantics. Design, implementation, analysis and control of distributed concurrent systems are notoriously complex tasks. Petri Nets are widely used to model concurrent activities. However, a higher-level programming abstraction is needed. We propose a new programming model for modeling concurrent coordination patterns, which is based on the idea of "peer workers" that represent re-usable coordination and application components. These components encapsulate behavior, structure distributed data and control flow, and allow integration of pre-existing service functions. A domain-specific language is presented. The usability of the peerbased programming model is evaluated with the Split/Join pattern.

show abstract

Partial Connector Colouring

Cited by 8 publications

References 15 publications

Partially distributed coordination with Reo and constraint automata

Partially distributed coordination with Reo and constraint automata

Interactive Interaction Constraints

Peer-Based Programming Model for Coordination Patterns

Contact Info

Product

Resources

About