By Topic

Concurrent statechart slicing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Luangsodsai, A. ; Sch. of Comput. Sci. & Electron. Eng., Univ. of Essex, Colchester, UK ; Fox, C.

The paper describes a system for slicing concurrent statecharts. Slicing seeks to remove those parts of a statechart that are not relevant for a given criteria. The technique can be applied to support model-based analysis, testing, debugging and maintenance of embedded systems and reactive systems. An And-Or dependence graph is used to represent the control and data dependencies of statecharts. The slicing algorithm determines the slice by traversing the dependence graph from a point that is specified by the slicing criteria. We deal with concurrent statecharts by taking into account of interference dependencies including parallel control dependence, interference control dependence and interference data dependence.

Published in:

Computer Science and Electronic Engineering Conference (CEEC), 2010 2nd

Date of Conference:

8-9 Sept. 2010