An Algebra for Block Diagram Languages - Archive ouverte HAL Access content directly
Conference Papers Year : 2002

An Algebra for Block Diagram Languages

Abstract

We propose an algebraic approach to block diagram construction as an alternative to the classical graph approach inspired by dataflow models. The proposed algebra is based on three binary operations of construction : sequential, parallel and recursive constructions. These operations can be seen as high level connection schemes that set several connections at once in order to combine two block diagrams to form a new one. Algebraic representations have interesting application for visual languages based on block diagrams and are useful to specify the formal semantic of these languages.
Fichier principal
Vignette du fichier
faust-icmc2002.pdf (117.2 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02158932 , version 1 (18-06-2019)

Identifiers

  • HAL Id : hal-02158932 , version 1

Cite

Yann Orlarey, Dominique Fober, Stéphane Letz. An Algebra for Block Diagram Languages. International Computer Music Conference, 2002, Gothenburg, Sweden. pp.542-547. ⟨hal-02158932⟩

Collections

GRAME FAUST
270 View
368 Download

Share

Gmail Mastodon Facebook X LinkedIn More