Handbook of theoretical computer science (vol. B)
Composition and behaviors of probabilistic I/O automata
Theoretical Computer Science
A formal basis for architectural connection
ACM Transactions on Software Engineering and Methodology (TOSEM)
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
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)
Interface synthesis and protocol conversion
Formal Aspects of Computing
The Algebra of Connectors—Structuring Interaction in BIP
IEEE Transactions on Computers
Introduction to Automata Theory, Languages, and Computation
Introduction to Automata Theory, Languages, and Computation
From Coordination to Stochastic Models of QoS
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Modal interfaces: unifying interface automata and modal specifications
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Timed I/O automata: a complete specification theory for real-time systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Component connectors with QoS guarantees
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
Mediating connector patterns for components interoperability
ECSA'10 Proceedings of the 4th European conference on Software architecture
Probabilistic contracts for component-based design
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
A theory of mediators for eternal connectors
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
The kell calculus: a family of higher-order distributed process calculi
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Towards an architecture for runtime interoperability
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Middleware'11 Proceedings of the 12th ACM/IFIP/USENIX international conference on Middleware
Proceedings of the 12th International Middleware Conference
A semi-automatic behavioral mediation approach based on models@runtime
Proceedings of the 7th Workshop on Models@run.time
Automatic synthesis of modular connectors via composition of protocol mediation patterns
Proceedings of the 2013 International Conference on Software Engineering
| Hi-index | 0.00 |
Interoperability of heterogeneous networked systems has yet to reach the maturity required by ubiquitous computing due to the technology-dependent nature of solutions. The CONNECT Integrated Project attempts to develop a novel network infrastructure to allow heterogeneous networked systems to freely communicate with one another by synthesising the required connectors on-the-fly. A key objective of CONNECT is to build a comprehensive theory of composable connectors, by devising an algebra for rigorously characterising complex interaction protocols in order to support automated reasoning. With this aim in mind, we formalise a high-level algebra for reasoning about protocol mismatches. Basic mismatches can be solved by suitably defined primitives, while complex mismatches can be settled by composition operators that build connectors out of simpler ones. The semantics of the algebra is given in terms of Interface Automata, and an example in the domain of instant messaging is used to illustrate how the algebra can characterise the interaction behaviour of a connector for mediating protocols.