Algebraic implementations preserve program correctness
Science of Computer Programming
A proof of the Kahn principle for input/output automata
Information and Computation
Algebraic Specification of Reactive Systems
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Adding Action Refinement to a Finite Process Algebra
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Towards a Precise Semantics for Object-Oriented Modeling Techniques
ECOOP '97 Proceedings of the Workshops on Object-Oriented Technology
Consistent Graphical Specification of Distributed Systems
FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
Refinement Calculus, Part II: Parallel and Reactive Programs
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Functional Specification of Time Sensitive Communicating Systems
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Refinement Calculus, Part I: Sequential Nondeterministic Programs
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Generalised Substitution Language and Differentials
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
A lightweight formal framework for service-oriented applications design
ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
| Hi-index | 0.00 |
We introduce a mathematical model of components that can be used for the description of both hardware and software units forming distributed interactive systems. As part of a distributed system a component interacts with its environment by exchanging messages in a time frame. The interaction is performed by accepting input and by producing output messages on named channels. We describe forms of composition and three forms of refinement, namely property refinement, glass box refinement, and interaction refinement. Finally, we prove the compositionality of the mathematical model with respect to the introduced refinement relations.