Causal semantics for the algebra of connectors
Formal Methods in System Design
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Büchi automata for modeling component connectors
Software and Systems Modeling (SoSyM)
Revisiting glue expressiveness in component-based systems
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
A connector algebra for P/T nets interactions
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Information and Software Technology
Runtime verification of component-based systems
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
A model of context-dependent component connectors
Science of Computer Programming
Heterogeneous verification of cyber-physical systems using behavior relations
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
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
Rigorous design of robot software: A formal component-based approach
Robotics and Autonomous Systems
Taming confusion for modeling and implementing probabilistic concurrent systems
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
On negotiation as concurrency primitive
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 15.00 |
We provide an algebraic formalization of connectors in the BIP component framework. A connector relates a set of typed ports. Types are used to describe different modes of synchronization: rendezvous and broadcast, in particular. Connectors on a set of ports P are modeled as terms of the algebra AC(P), generated from P by using a binary fusion operator and a unary typing operator. Typing associates with terms (ports or connectors) synchronization types --- trigger or synchron --- that determine modes of synchronization. Broadcast interactions are initiated by triggers. Rendezvous is a maximal interaction of a connector including only synchrons. The semantics of AC(P) associates with a connector the set of its interactions. It induces on connectors an equivalence relation which is not a congruence as it is not stable for fusion. We provide a number of properties of AC(P) used to symbolically simplify and handle connectors. We provide examples illustrating applications of AC(P), including a general component model encompassing synchrony, methods for incremental model decomposition, and efficient implementation by using symbolic techniques.