@inproceedings{ Orlarey:02a ,
title = {An Algebraic approach to Block Diagram Constructions},
author = {Yann Orlarey and Dominique Fober and Stephane Letz},
editor = {GMEM},
url = {faust-jim2002.pdf},
year = {2002},
date = {2002-01-01},
booktitle = {Actes des Journées d’Informatique Musicale JIM2002, Marseille},
pages = {151–158},
abstract = {We propose an algebraic approach to block diagram construction as an alternative to the classical graph approach inspired by dataflow models. This block diagram algebra is based on three binary operations : 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. Such algebraic representations have interesting applications for visual languages based on block diagrams. In particular they are very useful to specify the formal semantic of these languages.},
keywords = {algebra, block-diagram, dataflow, Denotational, DSP, graph, semantic},
pubstate = {published},
tppubtype = {inproceedings}
}
We propose an algebraic approach to block diagram construction as an alternative to the classical graph approach inspired by dataflow models. This block diagram algebra is based on three binary operations : 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. Such algebraic representations have interesting applications for visual languages based on block diagrams. In particular they are very useful to specify the formal semantic of these languages.
@inproceedings{ Orlarey:02b ,
title = {An Algebra for Block Diagram Languages},
author = {Yann Orlarey and Dominique Fober and Stephane Letz},
editor = {ICMA},
url = {faust-icmc2002.pdf},
year = {2002},
date = {2002-01-01},
booktitle = {Proceedings of International Computer Music Conference},
pages = {542–547},
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.},
keywords = {algebra, block-diagram, dataflow, Denotational, DSP, graph, semantic},
pubstate = {published},
tppubtype = {inproceedings}
}
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.
