Finite State Machines and Modal Models in Ptolemy II

This report describes the usage and semantics of finite-state machines (FSMs) and modal models in Ptolemy II. FSMs are actors whose behavior is described using a finite set of states and transitions between the states. The transitions between the states are enabled by guards which are boolean-valued expressions that can reference inputs to the actor and parameters in scope. The transitions can produce outputs and can update the value of parameters in scope. Modal models extend FSMs by allowing states to have refinements, which are hierarchical Ptolemy II models. The refinements may themselves be FSMs, modal models, or any composite actor containing a director compatible with the domain in which the modal model is being used. This report describes the operational semantics, the practical usage, and the semantics of time in modal models

Algorithm · Finite state · Geometry · Modal · Ptolemy's table of chords · State (computer science · Statistics · Chemistry · Classical Antiquity Studies · Computer Science · Logic, programming, and type systems · Mathematics