Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02158932
Contributor : Dominique Fober Connect in order to contact the contributor
Submitted on : Tuesday, June 18, 2019 - 2:12:29 PM
Last modification on : Tuesday, March 2, 2021 - 10:08:24 AM

File

faust-icmc2002.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02158932, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

168

Files downloads

287