Connector colouring I: Synchronisation and context dependency

Authors:
Dave Clarke;David Costa;Farhad Arbab
Affiliations:
CWI, P.O. Box 94079, NL-1090 GB Amsterdam, Netherlands;CWI, P.O. Box 94079, NL-1090 GB Amsterdam, Netherlands;CWI, P.O. Box 94079, NL-1090 GB Amsterdam, Netherlands
Venue:
Science of Computer Programming
Year:
2007

Citing 15
Cited 25

Generative communication in Linda

ACM Transactions on Programming Languages and Systems (TOPLAS)
The gamma model and its discipline of programming

Science of Computer Programming
TCP/IP illustrated (vol. 2): the implementation

TCP/IP illustrated (vol. 2): the implementation
Towards a taxonomy of software connectors

Proceedings of the 22nd international conference on Software engineering
A transition system semantics for the control-driven coordination language MANIFOLD

Theoretical Computer Science
The tile model

Proof, language, and interaction
The foundations of Esterel

Proof, language, and interaction
Network Algebra

Network Algebra
Distributed Algorithms

Distributed Algorithms
MPI: The Complete Reference

MPI: The Complete Reference
MoCha: A Middleware Based on Mobile Channels

COMPSAC '02 Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment
Reo: a channel-based coordination model for component composition

Mathematical Structures in Computer Science
Abstract behavior types: a foundation model for components and their composition

Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Synchronized hyperedge replacement for heterogeneous systems

COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Complete axioms for stateless connectors

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science

Coordination Models Orc and Reo Compared

Electronic Notes in Theoretical Computer Science (ENTCS)
Coordination: Reo, Nets, and Logic

Formal Methods for Components and Objects
Decomposing port automata

Proceedings of the 2009 ACM symposium on Applied Computing
A perspective on service orchestration

Science of Computer Programming
Deconstructing R eo

Electronic Notes in Theoretical Computer Science (ENTCS)
Automata for Context-Dependent Connectors

COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
The mythical matched modules: overcoming the tyranny of inflexible software construction

Proceedings of the 24th ACM SIGPLAN conference companion on Object oriented programming systems languages and applications
Connectors as Designs

Electronic Notes in Theoretical Computer Science (ENTCS)
Modeling dynamic reconfigurations in Reo using high-level replacement systems

Science of Computer Programming
Verification of context-dependent channel-based service models

FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Channel-based coordination via constraint satisfaction

Science of Computer Programming
Büchi automata for modeling component connectors

Software and Systems Modeling (SoSyM)
Encoding context-sensitivity in Reo into non-context-sensitive semantic models

COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Simulation-based performance analysis of channel-based coordination models

COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Puff, the magic protocol

Formal modeling
Automata based model checking for reo connectors

FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
A model of context-dependent component connectors

Science of Computer Programming
Compositional construction of real-time dataflow networks

COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
Connectors as designs: Modeling, refinement and test case generation

Science of Computer Programming
Dreams: a framework for distributed synchronous coordination

Proceedings of the 27th Annual ACM Symposium on Applied Computing
A Büchi automata based model checking framework for reo connectors

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Intentional automata: a context-dependent model for component connectors

FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Connector algebras, petri nets, and BIP

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Partial connector colouring

COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Propagation of constraints along model transformations using triple graph grammars and borrowed context

Journal of Visual Languages and Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Reo is a coordination model based on circuit-like connectors which coordinate components through the interplay of data flow, synchronisation and mutual exclusion, state, and context-dependent behaviour. This paper proposes a scheme based on connector colouring for determining the behaviour of a Reo connector by resolving its context dependent synchronisation and mutual exclusion constraints. Colouring a Reo connector in a specific state with given boundary conditions (I/O requests) provides a means to determine the routing alternatives for data flow. Our scheme has the advantage over previous models in that it is simpler to implement and that it models Reo connectors more closely in terms of their envisaged semantics than existing formal models.