Computing refactorings of state machines

Alexander Pretschner; Wolfgang Prenninger

doi:10.1007/s10270-006-0037-5

Computing refactorings of state machines

Alexander Pretschner
, Wolfgang Prenninger

ETH Zurich
Innovations

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	381-399
Number of pages	19
Journal	Software and Systems Modeling
Volume	6
Issue number	4
DOIs	https://doi.org/10.1007/s10270-006-0037-5
State	Published - Dec 2007
Externally published	Yes

Access to Document

10.1007/s10270-006-0037-5

Cite this

@article{9d364f7ce0ab42d18e7f4a2cde404983,

title = "Computing refactorings of state machines",

abstract = "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.",

author = "Alexander Pretschner and Wolfgang Prenninger",

year = "2007",

month = dec,

doi = "10.1007/s10270-006-0037-5",

language = "English",

volume = "6",

pages = "381--399",

journal = "Software and Systems Modeling",

issn = "1619-1366",

publisher = "Springer Verlag",

number = "4",

}

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 - https://www.scopus.com/pages/publications/36549054767

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 -

Computing refactorings of state machines

Abstract

Access to Document

Other files and links

Fingerprint

Cite this