%0 Book Section %1 wang_02_slicing %A Wang, Ji %A Dong, Wei %A Qi, Zhi C. %D 2002 %J Formal Methods and Software Engineering %K _hardcopy 2002 eha statecharts model_checking slicing uml %P 435--446 %R 10.1007/3-540-36103-0_45 %T Slicing Hierarchical Automata for Model Checking UML Statecharts %U http://dx.doi.org/10.1007/3-540-36103-0_45 %X Hierarchical Automata has been widely used in modeling dynamic aspects of reactive software, such as in UML Statecharts. At the same time, model checking is an automatic technique to ensure the correctness of software models, where state space explosion is the main obstacle to applying this technique in large scale applications. The paper presents a method for slicing hierarchical automata with respect to properties to be verified. The considered formalism is Extended Hierarchical Automata (EHA), in which a set of dependence relations is specified after analyzing characteristics such as hierarchy, concurrency and synchronization. We present the algorithm of slicing EHA based on the slicing criterion in terms of states and transitions. The algorithm can remove the hierarchies and concurrent states which are irrelevant to the property, and reduce the state space efficiently in model checking UML Statecharts.

@incollection{wang_02_slicing, abstract = {Hierarchical Automata has been widely used in modeling dynamic aspects of reactive software, such as in UML Statecharts. At the same time, model checking is an automatic technique to ensure the correctness of software models, where state space explosion is the main obstacle to applying this technique in large scale applications. The paper presents a method for slicing hierarchical automata with respect to properties to be verified. The considered formalism is Extended Hierarchical Automata (EHA), in which a set of dependence relations is specified after analyzing characteristics such as hierarchy, concurrency and synchronization. We present the algorithm of slicing EHA based on the slicing criterion in terms of states and transitions. The algorithm can remove the hierarchies and concurrent states which are irrelevant to the property, and reduce the state space efficiently in model checking UML Statecharts.}, added-at = {2009-02-11T22:21:17.000+0100}, author = {Wang, Ji and Dong, Wei and Qi, Zhi C.}, biburl = {https://www.bibsonomy.org/bibtex/2646dd5999aa3cde4549a00776297a3dc/leonardo}, citeulike-article-id = {2498002}, doi = {10.1007/3-540-36103-0_45}, interhash = {43f245e1c2fc3d68329102a46ea9f03b}, intrahash = {646dd5999aa3cde4549a00776297a3dc}, journal = {Formal Methods and Software Engineering}, keywords = {_hardcopy 2002 eha statecharts model_checking slicing uml}, pages = {435--446}, posted-at = {2008-03-10 00:31:55}, priority = {4}, timestamp = {2009-02-11T22:21:17.000+0100}, title = {Slicing Hierarchical Automata for Model Checking UML Statecharts}, url = {http://dx.doi.org/10.1007/3-540-36103-0_45}, year = 2002 }