TY - JOUR
T1 - Computing refactorings of state machines
AU - Pretschner, Alexander
AU - Prenninger, Wolfgang
PY - 2007/12
Y1 - 2007/12
N2 - For behavior models expressed in statechart-like formalisms, we show how to compute semantically equivalent yet structurally different models. These refactorings are defined by user-provided logical predicates that partition the system's state space and that characterize coherent parts - modes or control states - of the behavior. We embed the refactorings into an incremental development process that uses a combination of both tables and graphically represented state machines for describing systems.
AB - For behavior models expressed in statechart-like formalisms, we show how to compute semantically equivalent yet structurally different models. These refactorings are defined by user-provided logical predicates that partition the system's state space and that characterize coherent parts - modes or control states - of the behavior. We embed the refactorings into an incremental development process that uses a combination of both tables and graphically represented state machines for describing systems.
UR - http://www.scopus.com/inward/record.url?scp=36549054767&partnerID=8YFLogxK
U2 - 10.1007/s10270-006-0037-5
DO - 10.1007/s10270-006-0037-5
M3 - Article
AN - SCOPUS:36549054767
SN - 1619-1366
VL - 6
SP - 381
EP - 399
JO - Software and Systems Modeling
JF - Software and Systems Modeling
IS - 4
ER -