Communicating sequential processes
Communicating sequential processes
On the formalization of architectural types with process algebras
SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
Communication and Concurrency
A compositional formalization of connector wrappers
Proceedings of the 25th International Conference on Software Engineering
Categories for Software Engineering
Categories for Software Engineering
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
Composition for component-based modeling
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
A Framework for Component-based Construction Extended Abstract
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Modeling Heterogeneous Real-time Components in BIP
SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
Argos: an automaton-based synchronous language
Computer Languages
Distributed Semantics and Implementation for Systems with Interaction and Priority
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
A Notion of Glue Expressiveness for Component-Based Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Causal Semantics for the Algebra of Connectors
Formal Methods for Components and Objects
Coordinating Object Oriented Components Using Data-Flow Networks
Formal Methods for Components and Objects
A methodology and supporting tools for the development of component-based embedded systems
Proceedings of the 13th Monterey conference on Composition of embedded systems: scientific and industrial issues
Deriving complexity results for interaction systems from 1-safe Petri nets
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Causal semantics for the algebra of connectors
Formal Methods in System Design
MBEERTS'07 Proceedings of the 2007 International Dagstuhl conference on Model-based engineering of embedded real-time systems
Reasoning about safety and progress using contracts
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Synthesizing glue operators from glue constraints for the construction of component-based systems
SC'11 Proceedings of the 10th international conference on Software composition
Compositional strategy mapping
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Modeling dynamic architectures using Dy-BIP
SC'12 Proceedings of the 11th international conference on Software Composition
Compositionality in synchronous data flow: Modular code generation from hierarchical SDF graphs
ACM Transactions on Embedded Computing Systems (TECS)
Design synthesis and optimization for automotive embedded systems
Proceedings of the 2014 on International symposium on physical design
Hi-index | 0.00 |
We provide an algebraic formalisation of connectors in BIP. These are used to structure interactions in a component-based system. A connector relates a set of typed ports. Types are used to describe different modes of synchronisation: rendezvous and broadcast, in particular. Connectors on a set of ports P are modelled 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) synchronisation types - trigger or synchron - , which determine modes of synchronisation. 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.