Foundations for the study of software architecture
ACM SIGSOFT Software Engineering Notes
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)
Tile formats for located and mobile systems
Information and Computation - Special issue on EXPRESS 1997
Proof, language, and interaction
Dynamic connectors for concurrency
Theoretical Computer Science
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
Observational Equivalence for Synchronized Graph Rewriting with Mobility
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Span(Graph): A Categorial Algebra of Transition Systems
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Representing Place/Transition Nets in Span(Graph)
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Cartesian Closed Double Categories, Their Lambda-Notation, and the Pi-Calculus
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
Mathematical Structures in Computer Science
Reo: a channel-based coordination model for component composition
Mathematical Structures in Computer Science
Compositional semantics for open Petri nets based on deterministic processes
Mathematical Structures in Computer Science
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)
Modeling Heterogeneous Real-time Components in BIP
SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
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
The Algebra of Connectors—Structuring Interaction in BIP
IEEE Transactions on Computers
Recent Trends in Algebraic Development Techniques
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
A connector algebra for P/T nets interactions
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
| Hi-index | 0.00 |
In the area of component-based software architectures, the term connector has been coined to denote an entity (e.g. the communication network, middleware or infrastructure) that regulates the interaction of independent components. Hence, a rigorous mathematical foundation for connectors is crucial for the study of coordinated systems. In recent years, many different mathematical frameworks have been proposed to specify, design, analyse, compare, prototype and implement connectors rigorously. In this paper, we overview the main features of three notable frameworks and discuss their similarities, differences, mutual embedding and possible enhancements. First, we show that Sobocinski's nets with boundaries are as expressive as Sifakis et al.'s BI(P), the BIP component framework without priorities. Second, we provide a basic algebra of connectors for BI(P) by exploiting Montanari et al.'s tile model and a recent correspondence result with nets with boundaries. Finally, we exploit the tile model as a unifying framework to compare BI(P) with other models of connectors and to propose suitable enhancements of BI(P).