We illustrate how UML statechart diagrams as distinct from statecharts are formalized in the /spl pi/-calculus as a number of processes which communicate via a channel-passing interaction paradigm. Different types of equivalences of statechart diagrams, including isomorphism, strong behavioural equivalence and weak behavioural equivalence are defined in terms of structural congruence, strong open bisimulation and weak open bisimulation of the /spl pi/-calculus. Checking equivalence of any two statechart diagrams is transformed to a problem of verifying whether the corresponding /spl pi/-calculus process expressions are equivalent.
%0 Conference Paper
%1 lam_03_analyzing
%A Lam, Vitus S. W.
%A Padget, J.
%D 2003
%J Human Centric Computing Languages and Environments, 2003. Proceedings. 2003 IEEE Symposium on
%K equivalence semantics statecharts 2003 uml
%P 137--144
%R 10.1109/HCC.2003.1260217
%T Analyzing equivalences of UML statechart diagrams by structural congruence and open bisimulations
%U http://dx.doi.org/10.1109/HCC.2003.1260217
%X We illustrate how UML statechart diagrams as distinct from statecharts are formalized in the /spl pi/-calculus as a number of processes which communicate via a channel-passing interaction paradigm. Different types of equivalences of statechart diagrams, including isomorphism, strong behavioural equivalence and weak behavioural equivalence are defined in terms of structural congruence, strong open bisimulation and weak open bisimulation of the /spl pi/-calculus. Checking equivalence of any two statechart diagrams is transformed to a problem of verifying whether the corresponding /spl pi/-calculus process expressions are equivalent.
@inproceedings{lam_03_analyzing,
abstract = {We illustrate how UML statechart diagrams as distinct from statecharts are formalized in the /spl pi/-calculus as a number of processes which communicate via a channel-passing interaction paradigm. Different types of equivalences of statechart diagrams, including isomorphism, strong behavioural equivalence and weak behavioural equivalence are defined in terms of structural congruence, strong open bisimulation and weak open bisimulation of the /spl pi/-calculus. Checking equivalence of any two statechart diagrams is transformed to a problem of verifying whether the corresponding /spl pi/-calculus process expressions are equivalent.},
added-at = {2009-02-12T11:39:03.000+0100},
author = {Lam, Vitus S. W. and Padget, J.},
biburl = {https://www.bibsonomy.org/bibtex/2880443d440372ede9305eea436843d2b/leonardo},
citeulike-article-id = {744515},
doi = {10.1109/HCC.2003.1260217},
interhash = {c2e61fc12a822fcdeec831d895ffa41c},
intrahash = {880443d440372ede9305eea436843d2b},
journal = {Human Centric Computing Languages and Environments, 2003. Proceedings. 2003 IEEE Symposium on},
keywords = {equivalence semantics statecharts 2003 uml},
pages = {137--144},
posted-at = {2006-07-07 02:23:17},
priority = {4},
timestamp = {2009-02-12T11:39:03.000+0100},
title = {Analyzing equivalences of UML statechart diagrams by structural congruence and open bisimulations},
url = {http://dx.doi.org/10.1109/HCC.2003.1260217},
year = 2003
}