<html><head>
      <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
   <title>Meta State Machine (MSM) V2.12</title><link rel="stylesheet" href="boostbook.css" type="text/css"><meta name="generator" content="DocBook XSL-NS Stylesheets V1.75.2"><link rel="home" href="index.html" title="Meta State Machine (MSM) V2.12"><link rel="next" href="pr01.html" title="Preface"></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Meta State Machine (MSM) V2.12</th></tr><tr><td width="20%" align="left">&nbsp;</td><th width="60%" align="center">&nbsp;</th><td width="20%" align="right">&nbsp;<a accesskey="n" href="pr01.html">Next</a></td></tr></table><hr></div><div class="book" title="Meta State Machine (MSM) V2.12"><div class="titlepage"><div><div><h1 class="title"><a name="d0e2"></a>Meta State Machine (MSM) V2.12</h1></div><div><div class="author"><h3 class="author">Christophe Henry</h3><code class="email">&lt;<a class="email" href="mailto:christophe.j.henry@googlemail.com">christophe.j.henry@googlemail.com</a>&gt;</code></div></div><div><p class="copyright">Copyright &copy; 2008-2010 
                <span> Distributed under the Boost Software License, Version 1.0. (See
                    accompanying file LICENSE_1_0.txt or copy at <a class="link" href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a> ) </span>
            </p></div></div><hr></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><span class="preface"><a href="pr01.html">Preface</a></span></dt><dt><span class="part"><a href="pt01.html">I. User' guide</a></span></dt><dd><dl><dt><span class="chapter"><a href="ch01.html">1. Founding idea</a></span></dt><dt><span class="chapter"><a href="ch02.html">2. UML Short Guide</a></span></dt><dd><dl><dt><span class="sect1"><a href="ch02.html#d0e201">What are state machines?</a></span></dt><dt><span class="sect1"><a href="ch02s02.html">Concepts</a></span></dt><dd><dl><dt><span class="sect2"><a href="ch02s02.html#d0e211">State machine, state, transition, event </a></span></dt><dt><span class="sect2"><a href="ch02s02.html#d0e241">Submachines, orthogonal regions, pseudostates </a></span></dt><dt><span class="sect2"><a href="ch02s02.html#d0e284">
                        History </a></span></dt><dt><span class="sect2"><a href="ch02s02.html#d0e298">Completion transitions / anonymous
                        transitions</a></span></dt><dt><span class="sect2"><a href="ch02s02.html#d0e310"> Internal transitions </a></span></dt><dt><span class="sect2"><a href="ch02s02.html#d0e316">
                        Conflicting transitions </a></span></dt></dl></dd><dt><span class="sect1"><a href="ch02s03.html">State machine glossary</a></span></dt></dl></dd><dt><span class="chapter"><a href="ch03.html">3. Tutorial</a></span></dt><dd><dl><dt><span class="sect1"><a href="ch03.html#d0e405">Design</a></span></dt><dt><span class="sect1"><a href="ch03s02.html">Basic front-end</a></span></dt><dd><dl><dt><span class="sect2"><a href="ch03s02.html#d0e424">A simple example</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e438">Transition table</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e486">Defining states with entry/exit actions</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e499">Defining a simple state machine</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e554">Defining a submachine</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e589">Orthogonal regions, terminate state, event deferring</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e680">History</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e725">Completion (anonymous) transitions</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e752">Internal transitions</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e854">more row types</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e887">Explicit entry / entry and exit pseudo-state / fork</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e1054">Flags</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e1108">Event Hierarchy</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e1129">Customizing a state machine / Getting more speed</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e1178">Choosing the initial event</a></span></dt><dt><span class="sect2"><a href="ch03s02.html#d0e1191"> Containing state machine (deprecated)</a></span></dt></dl></dd><dt><span class="sect1"><a href="ch03s03.html">Functor front-end</a></span></dt><dd><dl><dt><span class="sect2"><a href="ch03s03.html#d0e1230"> Transition table </a></span></dt><dt><span class="sect2"><a href="ch03s03.html#d0e1263">Defining states with entry/exit actions</a></span></dt><dt><span class="sect2"><a href="ch03s03.html#d0e1282">Defining a simple state machine</a></span></dt><dt><span class="sect2"><a href="ch03s03.html#d0e1290">Anonymous transitions</a></span></dt><dt><span class="sect2"><a href="ch03s03.html#d0e1316">Internal
                        transitions</a></span></dt></dl></dd><dt><span class="sect1"><a href="ch03s04.html">eUML (experimental)</a></span></dt><dd><dl><dt><span class="sect2"><a href="ch03s04.html#d0e1395">Transition table</a></span></dt><dt><span class="sect2"><a href="ch03s04.html#d0e1436">Defining events, actions and states with entry/exit actions</a></span></dt><dt><span class="sect2"><a href="ch03s04.html#d0e1549">Defining a simple state machine</a></span></dt><dt><span class="sect2"><a href="ch03s04.html#d0e1597">Defining a submachine</a></span></dt><dt><span class="sect2"><a href="ch03s04.html#d0e1613">
                        Attributes / Function call</a></span></dt><dt><span class="sect2"><a href="ch03s04.html#d0e1713">Orthogonal regions, flags, event deferring</a></span></dt><dt><span class="sect2"><a href="ch03s04.html#d0e1825">
                        Customizing a state machine / Getting
                        more speed</a></span></dt><dt><span class="sect2"><a href="ch03s04.html#d0e1860">Completion / Anonymous transitions</a></span></dt><dt><span class="sect2"><a href="ch03s04.html#d0e1878">Internal transitions</a></span></dt><dt><span class="sect2"><a href="ch03s04.html#d0e1909">Other state types</a></span></dt><dt><span class="sect2"><a href="ch03s04.html#d0e1973">Helper functions</a></span></dt><dt><span class="sect2"><a href="ch03s04.html#d0e2070">Phoenix-like STL support</a></span></dt></dl></dd><dt><span class="sect1"><a href="ch03s05.html">Back-end</a></span></dt><dd><dl><dt><span class="sect2"><a href="ch03s05.html#d0e2128">Creation </a></span></dt><dt><span class="sect2"><a href="ch03s05.html#d0e2137">Starting a state machine</a></span></dt><dt><span class="sect2"><a href="ch03s05.html#d0e2149">Event dispatching</a></span></dt><dt><span class="sect2"><a href="ch03s05.html#d0e2158">Active state(s)</a></span></dt><dt><span class="sect2"><a href="ch03s05.html#d0e2172">Serialization</a></span></dt><dt><span class="sect2"><a href="ch03s05.html#d0e2225">Base state type </a></span></dt><dt><span class="sect2"><a href="ch03s05.html#d0e2251">Visitor</a></span></dt><dt><span class="sect2"><a href="ch03s05.html#d0e2294">Flags</a></span></dt><dt><span class="sect2"><a href="ch03s05.html#d0e2307">Getting a state</a></span></dt><dt><span class="sect2"><a href="ch03s05.html#d0e2320"> State machine constructor with arguments </a></span></dt><dt><span class="sect2"><a href="ch03s05.html#d0e2360">Trading run-time speed for
                        better compile-time / multi-TU compilation</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="ch04.html">4.  Performance / Compilers</a></span></dt><dd><dl><dt><span class="sect1"><a href="ch04.html#d0e2464">Speed</a></span></dt><dt><span class="sect1"><a href="ch04s02.html">Executable size</a></span></dt><dt><span class="sect1"><a href="ch04s03.html">Supported compilers</a></span></dt><dt><span class="sect1"><a href="ch04s04.html"> Limitations </a></span></dt><dt><span class="sect1"><a href="ch04s05.html"> Compilers corner </a></span></dt></dl></dd><dt><span class="chapter"><a href="ch05.html">5. Questions &amp; Answers</a></span></dt><dt><span class="chapter"><a href="ch06.html">6. Internals</a></span></dt><dd><dl><dt><span class="sect1"><a href="ch06.html#d0e2656">Backend: Run To Completion</a></span></dt><dt><span class="sect1"><a href="ch06s02.html">Frontend / Backend
                    interface</a></span></dt><dt><span class="sect1"><a href="ch06s03.html"> Generated state ids </a></span></dt><dt><span class="sect1"><a href="ch06s04.html">Metaprogramming tools</a></span></dt></dl></dd><dt><span class="chapter"><a href="ch07.html">7. Acknowledgements</a></span></dt><dd><dl><dt><span class="sect1"><a href="ch07.html#d0e2951">MSM v2</a></span></dt><dt><span class="sect1"><a href="ch07s02.html"> MSM v1</a></span></dt></dl></dd><dt><span class="chapter"><a href="ch08.html">8. Version history</a></span></dt><dd><dl><dt><span class="sect1"><a href="ch08.html#d0e2995">From V2.10 to V2.12</a></span></dt><dt><span class="sect1"><a href="ch08s02.html">From V2.0 to V2.12</a></span></dt></dl></dd></dl></dd><dt><span class="part"><a href="pt02.html">II. Reference</a></span></dt><dd><dl><dt><span class="chapter"><a href="ch09.html">9. eUML operators and basic helpers</a></span></dt><dt><span class="chapter"><a href="ch10.html">10. 
                Functional programming </a></span></dt><dt><span class="refentrytitle"><a href="re01.html">Common headers</a></span><span class="refpurpose"> &#8212; The common types used by front- and back-ends</span></dt><dt><span class="refentrytitle"><a href="re02.html">Back-end</a></span><span class="refpurpose"> &#8212; The back-end headers</span></dt><dt><span class="refentrytitle"><a href="re03.html">Front-end</a></span><span class="refpurpose"> &#8212; The front-end headers</span></dt></dl></dd></dl></div><div class="list-of-tables"><p><b>List of Tables</b></p><dl><dt>9.1. <a href="ch09.html#d0e3064">Operators and state machine helpers</a></dt><dt>10.1. <a href="ch10.html#d0e3419">STL algorithms</a></dt><dt>10.2. <a href="ch10.html#d0e3532">STL algorithms</a></dt><dt>10.3. <a href="ch10.html#d0e3560">STL algorithms</a></dt><dt>10.4. <a href="ch10.html#d0e3778">STL container methods</a></dt><dt>10.5. <a href="ch10.html#d0e3909">STL list methods</a></dt><dt>10.6. <a href="ch10.html#d0e3985">STL associative container methods </a></dt><dt>10.7. <a href="ch10.html#d0e4056">STL pair</a></dt><dt>10.8. <a href="ch10.html#d0e4082">STL string</a></dt></dl></div></div><div class="navfooter"><hr><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left">&nbsp;</td><td width="20%" align="center">&nbsp;</td><td width="40%" align="right">&nbsp;<a accesskey="n" href="pr01.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">&nbsp;</td><td width="20%" align="center">&nbsp;</td><td width="40%" align="right" valign="top">&nbsp;Preface</td></tr></table></div></body></html>