Formalizing statecharts using hierarchical automata

Helke, Steffen and Kammueller, Florian (2010) Formalizing statecharts using hierarchical automata. Archive of Formal Proof . ISSN 2150-914X

Full text is not in this repository.


We formalize in Isabelle/HOL the abtract syntax and a synchronous step semantics for the specification language Statecharts. The formalization is based on Hierarchical Automata which allow a structural decomposition of Statecharts into Sequential Automata. To support the composition of Statecharts, we introduce calculating operators to construct a Hierarchical Automaton in a stepwise manner. Furthermore, we present a complete semantics of Statecharts including a theory of data spaces, which enables the modelling of racing effects. We also adapt CTL for Statecharts to build a bridge for future combinations with model checking. However the main motivation of this work is to provide a sound and complete basis for reasoning on Statecharts. As a central meta theorem we prove that the well-formedness of a Statechart is preserved by the semantics.
(Abstract as appears of publisher website)

Item Type: Article
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
A. > School of Science and Technology > Computer Science > Artificial Intelligence group
Item ID: 9091
Useful Links:
Depositing User: Dr Florian Kammueller
Date Deposited: 25 May 2012 11:57
Last Modified: 13 Oct 2016 14:24

Actions (login required)

Edit Item Edit Item