Communicating sequential processes
Communicating sequential processes
A model for distributed systems based on graph rewriting
Journal of the ACM (JACM)
Parallel program design: a foundation
Parallel program design: a foundation
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
Categorical semantics of parallel program design
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
Information and Computation - Special issue on EXPRESS 1997
Proof, language, and interaction
Network Algebra
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
Theoretical Computer Science - Rewriting logic and its applications
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
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Categories for Software Engineering
Categories for Software Engineering
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)
Complete axioms for stateless connectors
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
A Basic Logic for Reasoning about Connector Reconfiguration
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
Causal Semantics for the Algebra of Connectors
Formal Methods for Components and Objects
Proceedings of the 2009 ACM symposium on Applied Computing
Causal semantics for the algebra of connectors
Formal Methods in System Design
Representations of Petri net interactions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Synthesizing glue operators from glue constraints for the construction of component-based systems
SC'11 Proceedings of the 10th international conference on Software composition
The microcosm principle and compositionality of GSOS-based component calculi
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
A connector algebra for P/T nets interactions
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
A model of context-dependent component connectors
Science of Computer Programming
Intentional automata: a context-dependent model for component connectors
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
A specification language for reo 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
A Basic Logic for Reasoning about Connector Reconfiguration
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Automatic synthesis of modular connectors via composition of protocol mediation patterns
Proceedings of the 2013 International Conference on Software Engineering
Producing software by integration: challenges and research directions (keynote)
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
| 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 an algebra of connectors that exploits five kinds of basic connectors (plus their duals), namely symmetry, synchronization, mutual exclusion, hiding and inaction. Basic connectors can be composed in series and in parallel. 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. The expressiveness of the framework is witnessed by the ability to model all the (stateless) connectors of the architectural design language CommUnity and of the coordination language Reo.