|
Title
|
|
|
|
Introduction to statecharts modeling, simulation, testing, and deployment
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| Statecharts, introduced by David Harel in 1987, is a formalism used to specify the behavior of timed, autonomous, and reactive systems using a discrete-event abstraction. It extends Timed Finite State Automata with depth, orthogonality, broadcast communication, and history. Its visual representation is based on higraphs, which combine hypergraphs and Euler diagrams. Many tools offer visual editing, simulation, and code synthesis support for Statecharts. Examples include STATEMATE, Rhapsody, Yakindu, and Stateflow, each implementing different variants of Harels original semantics. This tutorial introduces modeling, simulation, testing, and deployment of Statecharts. We start from the basic concepts of states and transitions and explain the more advanced concepts of Statecharts by extending a running example (a traffic light) incrementally. We use Yakindu to model the example system. This is an updated version of the paper with the same name that appeared at the Winter Simulation Conference in 2018 (Van Mierlo and Vangheluwe 2018). |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
Proceedings of the ... Winter Simulation Conference. - New York, NY, 1980, currens
| |
|
Source (book)
|
|
|
|
2019 Winter Simulation Conference (WSC), 8-11 December, 2019, National Harbor, Maryland, USA
| |
|
Publication
|
|
|
|
New York, NY
:
IEEE
,
2020
| |
|
ISSN
|
|
|
|
1558-4305
| |
|
ISBN
|
|
|
|
978-1-72813-283-9
| |
|
DOI
|
|
|
|
10.1109/WSC40007.2019.9004771
| |
|
Volume/pages
|
|
|
|
p. 1504-1518
| |
|
Full text (Publisher's DOI)
|
|
|
|
| |
|
Full text (publisher's version - intranet only)
|
|
|
|
| |
|