Communicating sequential processes
Communicating sequential processes
A model for distributed systems based on graph rewriting
Journal of the ACM (JACM)
Towards a new algebraic foundation of flowchart scheme theory
Fundamenta Informaticae
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
An algebraic semantics for structured transition systems and its application to logic programs
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
Information and Computation
Information and Computation - Special issue on EXPRESS 1997
Proof, language, and interaction
Network Algebra
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Normal forms for algebras of connections
Theoretical Computer Science
Compositionality Through an Operational Semantics of Contexts
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Categories for Software Engineering
Categories for Software Engineering
Graph-grammars: An algebraic approach
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
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
Formal Semantics and Analysis of Component Connectors in Reo
Electronic Notes in Theoretical Computer Science (ENTCS)
Connector Colouring I: Synchronisation and Context Dependency
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The conceptual separation between computation and coordination in distributed computing systems motivates the use of peculiar entities commonly called connectors, whose task is managing the interaction among distributed components. Different kinds of connectors exist in the literature, at different levels of abstraction. We focus on a basic algebra of connectors which is expressive enough to model, e.g., all the architectural connectors of CommUnity. We first define the operational, observational and denotational semantics of connectors, then we show that the observational and denotational semantics coincide and finally we give a complete normal-form axiomatization.