Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
An overview of Manifold and its implementation
Concurrency: Practice and Experience
Non-monotonic concurrent constraint programming
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Component Software: Beyond Object-Oriented Programming
Component Software: Beyond Object-Oriented Programming
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
Piccola - A Small Compositional Language (Invited Talk)
Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS)
The Join Calculus: A Language for Distributed Mobile Programming
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Hierarchical Concurrent Finite State Machines in Ptolemy
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
The Ptolemy II Framework for Visual Languages
HCC '01 Proceedings of the IEEE 2001 Symposia on Human Centric Computing Languages and Environments (HCC'01)
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
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
A basic algebra of stateless connectors
Theoretical Computer Science - Algebra and coalgebra in computer science
Connector colouring I: Synchronisation and context dependency
Science of Computer Programming
Towards a Coordination Model for Interactive Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Recasting Constraint Automata into Büchi Automata
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
The Algebra of Connectors—Structuring Interaction in BIP
IEEE Transactions on Computers
Modeling Component Connectors: Synchronisation and Context-Dependency
SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
Building Mashups for the Enterprise with SABRE
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Proceedings of the 2009 ACM symposium on Applied Computing
A perspective on service orchestration
Science of Computer Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Semantics and Analysis of Component Connectors in Reo
Electronic Notes in Theoretical Computer Science (ENTCS)
Modeling and analysis of Reo connectors using alloy
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
A specification language for reo connectors
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
A compositional model to reason about end-to-end QoS in Stochastic Reo connectors
Science of Computer Programming
| Hi-index | 0.00 |
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. To increase the expressiveness of connectors, notions of context-dependent behaviour have been proposed. Context dependency can be used can express the priority of one behaviour over another and the inhibition of actions due to changing context. The notion of context we consider in this paper is given by the pending activities on the ports of a connector. Context-dependent behaviour occurs whenever the choices available to a connector change non-monotonically as its context changes. 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.