Algebraic theory of processes
Merging behavior specifications
Formal Methods in System Design
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Conformance Relation, Associated Equivalence, and New Canonical Tester in LOTOS
Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XI
Testing Concurrent Systems: A Formal Approach
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Trust in MDE components: the DOMINO experiment
Proceedings of the International Workshop on Security and Dependability for Resource Constrained Embedded Systems
Hi-index | 0.01 |
In this paper, we show how to implement the conformance relation on transition systems. The computability of this relation relies on the composition of two operators: the reduction relation whose computability has been proven in our previous work, and the merge function of acceptance graphs associated with transition systems under comparison. It is formally demonstrated, and illustrated through a case study whose analysis is performed by a Javaprototype we have developed. This research work is developed in order to be applied in a larger context: our goal is to support modelers to develop UML state machines through an incremental modelling method which is able to guarantee that model upgrading does not introduce inconsistencies. Hence, these works lead to a semantics for the specialisation relation between UML State Machines.