Equivalence checking of communicating UML statechart diagrams
Lam, V. S. W. and Padget, J., 2012. Equivalence checking of communicating UML statechart diagrams. International Journal of Software Engineering and Knowledge Engineering, 22 (2), pp. 265-304.
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below. (Contact Author)
We demonstrate how a subset of UML statechart diagrams (SCDs) as distinct from statecharts is encoded in the π-calculus as a number of processes which communicate via a channel-passing interaction paradigm. An extension to the original UML semantics for communicating statechart diagrams is presented. Different sorts of equivalences of UML SCDs encompassing isomorphism, strong behavioural equivalence and weak behavioural equivalence are defined. Determining equivalence of any two UML SCDs is transformed to a problem of checking whether their respective π-calculus process expressions are equivalent. The practicality of the approach is exemplified using an industry level case study.
|Creators||Lam, V. S. W.and Padget, J.|
|Departments||Faculty of Science > Computer Science|
Actions (login required)