Flowchart Behaviors

This chapter deals with the structures which serve as the standard models for (functorial) flowchart semantics. Recall from Example 11.1.7 that one can identify a flowchart scheme n → p with a presentation D = (α; a) in a free tree theory ∑tr. (Here α is a partial base morphism and each component of a is the composite of an atomic tree with a partial base morphism.) Thus, if T is any iteration theory and φ: ∑ → T is any function mapping letters in ∑ _n to morphisms 1 → n in T, n > 0, φ extends uniquely to both a theory morphism ∑tr → T and also to a morphism of presentations: $$ D\varphi : = \left( {\alpha ;a\varphi } \right). $$