Abstract
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:
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bloom, S.L., Ésik, Z. (1993). Flowchart Behaviors. In: Iteration Theories. EATCS Monographs on Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78034-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-78034-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-78036-3
Online ISBN: 978-3-642-78034-9
eBook Packages: Springer Book Archive