On testing and conformance relations for UML statechart diagrams behaviours

Authors:
Diego Latella;Mieke Massink
Affiliations:
Consiglio Nazionale delle Ricerche, Ist. CNUCE, Via Moruzzi 1, I56124 Pisa, Italy;Consiglio Nazionale delle Ricerche, Ist. CNUCE, Via Moruzzi 1, I56124 Pisa, Italy
Venue:
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Year:
2002

Citing 5
Cited 3

Extensional equivalence for transition systems

Acta Informatica
Algebraic theory of processes

Algebraic theory of processes
Finite state machine based formal methods in protocol conformance testing: from theory to implementation

Computer Networks and ISDN Systems - Protocol specification, testing and verification
A Formal Testing Framework for UML Statechart Diagrams Behaviours: From Theory to Automatic Verification

HASE '01 The 6th IEEE International Symposium on High-Assurance Systems Engineering: Special Topic: Impact of Networking
Towards a Formal Operational Semantics of UML Statechart Diagrams

Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS)

UML state machine diagram driven runtime verification of Java programs for message interaction consistency

Proceedings of the 2008 ACM symposium on Applied computing
Conformance Testing Based on UML State Machines

ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Model-Based testing of thin-client web applications

FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the formal relationship between testing preorder/equivalences for a behavioural subset of UML Statechart Diagrams and a conformance relation for implementations with respect to specifications given using such diagrams. We study the impact of stuttering on the above mentioned relationship. In the context of UMLSDs, stuttering occurs when no transition of the UMLSD is enabled by the current event in the current (global) state of the underlying state-machine. We consider both the case in which the semantics underlying the testing relations does not model stuttering explicitly - we call it the non-stuttering semantics - and the case in which it does it - i.e. the stuttering semantics. We show that in the first case the conformance relation is stronger than the reverse of the MUST preorder and, consequently, stronger than the MAY preorder. Much more interesting results can be proven in the second case, possibly under proper conditions on the sets of events under consideration. In fact the conformance relation is shown to coincide with the MAY preorder, and thus be implied by the reverse MUST preorder. Finally, we show important substitutivity properties which hold in the case of stuttering semantics.