Translating Task Models to State Machines

Andreas Wagner, Christian Prehofer

2016

Abstract

We present a new method to translate the established and well-known ConcurTaskTree (CTT) task modeling technique into state machines. For this purpose, we develop the concepts of partial state machines, Connectables and a connect operator, which form the theoretical framework for a new algorithm. For the translation, we develop and present a recursive, bottom-up algorithm, which exploits the inherent structure of CTTs and produces valid, partial state machines. This allows new development processes in the model-driven application and system development domain.

Paper Citation

in Harvard Style

Wagner A. and Prehofer C. (2016). Translating Task Models to State Machines . In Proceedings of the 4th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD, ISBN 978-989-758-168-7, pages 201-208. DOI: 10.5220/0005681702010208

in Bibtex Style

@conference{modelsward16,
author={Andreas Wagner and Christian Prehofer},
title={Translating Task Models to State Machines},
booktitle={Proceedings of the 4th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,},
year={2016},
pages={201-208},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005681702010208},
isbn={978-989-758-168-7},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Conference on Model-Driven Engineering and Software Development - Volume 1: MODELSWARD,
TI - Translating Task Models to State Machines
SN - 978-989-758-168-7
AU - Wagner A.
AU - Prehofer C.
PY - 2016
SP - 201
EP - 208
DO - 10.5220/0005681702010208