Topology and category theory in computer science
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A logical theory of concurrent objects and its realization in the Maude language
Research directions in concurrent object-oriented programming
Hiding and behaviour: an institutional approach
A classical mind
Logical foundations of cafeOBJ
Theoretical Computer Science - Rewriting logic and its applications
CASL: the common algebraic specification language
Theoretical Computer Science
Sheaves, Objects, and Distributed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
An Algebraic Framework for Modeling of Mobile Systems
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Hi-index | 0.01 |
Behavioural specification based on hidden (sorted) algebra constitutes one of the most promising recently developed formal specification and verification paradigms for system development.Here we formally introduce novel concepts of behavioural object and equivalence between behavioural objects within the hidden algebra framework. We formally define several object composition operators on behavioural objects corresponding to the hierarchical object composition methodology introduced by CafeOBJ. We study their basic semantical properties and show that our most general form of behavioural object composition with synchronisation has final semantics and a composability property of behavioural equivalence supporting a high reusability of verifications. We also show the commutativity and the associativity of parallel compositions without synchronisation.