Practical UML Statecharts in C/C++ Second Edition bridges the gap between high-level abstract concepts of the Unified Modeling Language (UML) and the actual programming aspects of modern hierarchical state machines (UML statecharts). The book describes a lightweight, open source, event-driven infrastructure, called QP that enables direct manual coding UML statecharts and concurrent event-driven applications in C or C++ without big tools. Part I provides a practical description of relevant state machine concepts. In Part II, readers will find a detailed design study of a generic real-time framework.
The shear volume of embedded code produced by programmers demands a unified language and framework to create efficient and maintainable systems. UML(unified modeling language) statecharts are a practical way in which to create this framework. The software framework of from the first edition is now open source and has been significantly improved and expanded. It is now compatible with the very popular ARM7 architecture and Cortex-M3. This book is presented in two parts, the first introduces statecharts, how to design with them and how to code them directly into C/C++ without the use of expensive tools. Part two introduces the author's event-driven framework for executing the material presented in part one.
Inhaltsverzeichnis
Preface PART I STATECHARTS Chapter 1 Whirlwind Tour of Programming with Statecharts1.1 Why Bother?1.2 The Traditional Event-Action Paradigm1.3 State Machines ? A Better Way of Programming1.3.1 The Time Bomb Example1.3.2 The Calculator Example1.5 Object-Oriented Analogy1.6 The Event-driven Framework1.6 SummaryChapter 2 A Crash Course in Statecharts 2.1 The Essence of Finite State Machines2.2 The Essence of UML Statecharts2.3 Examples of State Models2.4 SummaryChapter 3 Standard State Machine Implementations3.1 State Machine Interface3.2 Nested switch Statement3.3 State Table3.4 State Design Pattern3.5 Optimal FSM Implementation3.6 State Machines and C++ Exception Handling 3.7 Role of Pointer-to-Member Functions3.8 Implementing Guards, Junctions, and Choice Points3.9 Implementing Entry and Exit Actions3.10 Dealing with State Hierarchy3.11 SummaryChapter 4 QEP: A Minimal Hierarchical Event Processor4.1 General Structure of the QEP Event Processor4.2 An Annotated Example (QHsm)4.3 QEP Structure4.3.1 QEP Source Code Structure4.3.2 Internal Representation of a State Machine4.3.3 Initialization of a State Machine4.3.4 Dispatching Events to a FSM4.3.5 Executing a Transition in a FSM4.3.6 Dispatching Events to a HSM4.3.7 Executing a Transition in a HSM4.3.8 Static Transition Optimization in a HSM4.4 Porting and Configuring QEP4.5 Caveats4.6 Su