CSP-OZ: a combination of object-Z and CSP
FMOODS '97 Proceedings of the IFIP TC6 WG6.1 international workshop on Formal methods for open object-based distributed systems
Behavior Protocols for Software Components
IEEE Transactions on Software Engineering
A Hoare Calculus for Verifying Java Realizations of OCL-Constrained Design Models
FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Glass-Box and Black-Box Views on Object-Oriented Specifications
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Component Substitutability via Equivalencies of Component-Interaction Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
The STSLib Project: Towards a Formal Component Model Based on STS
Electronic Notes in Theoretical Computer Science (ENTCS)
Refinement of Interface Automata Strengthened by Action Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Observable Behaviour of Composite Components
Electronic Notes in Theoretical Computer Science (ENTCS)
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
Views on behaviour protocols and their semantic foundation
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
rCOS: refinement of component and object systems
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
On weak modal compatibility, refinement, and the MIO workbench
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A modal interface theory with data constraints
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
| Hi-index | 0.00 |
We propose a formal foundation for behaviour protocols of interacting, concurrent components with data states. Formally, behaviour protocols are given by labelled transition systems which specify the order of operation invocations as well as the allowed changes of data states of components in terms of pre- and postconditions. We study the compatibility of protocols and we consider their composition which yields a behaviour protocol for a component assembly. Behaviour protocols are equipped with a model-theoretic semantics which describes the class of all correct component or assembly implementations. Implementation models are again formalised in terms of labelled transition systems and the correctness notion is based on an alternating simulation relation between protocol and implementation which takes into account concrete control and data states. As a major result we show that our approach is compositional, i.e. that locally correct implementation models of compatible protocols compose to a globally correct implementation, thus ensuring independent implementability.