Citation
Chris Shaver. "Alternative Syntactic Representations of Graph-Based Models". Talk or presentation, 16, February, 2011; Poster presented at the Ninth Biennial Ptolemy Miniconference, Berkeley, CA.

Abstract
Models constituted of entities connected by relations between ports form diagramatic representations of systems. Whereas these models are often are constructed with a point-to-point syntax, either graphically or lexically using named ports, alternative syntaxes using combinators offer a different perspective on design and an alternative codification of compositional information. Rather than connecting parts of a system with individual point-to-point declarations of connections, a combinator syntax builds up a system as an expression of compositions hierarchically structured in a functional mannar. Drawing from the expression syntax of Milner's Process Algebra, diagrammatic connections to linear algebra, and the DSP programming language Faust, a combinator syntax has been developed both as notational and a diagrammatic system serving the purpose of expressing general diagrammatic models. This combinator syntax can be used as a means to both design systems and analyze systems in a compositional manner. An implementation of an algorithm has been integrated into Ptolemy which forms both the graphical and textual forms of this combinator syntax from a large class of Ptolemy models.

Electronic downloads

• p11Shaversyntacticposter.pdf · application/pdf · 308 kbytes

• HTML

  Chris Shaver. <a
  href="http://chess.eecs.berkeley.edu/pubs/825.html"><i>Alternative
  Syntactic Representations of Graph-Based
  Models</i></a>, Talk or presentation,  16,
  February, 2011; Poster presented at the <a
  href="http://ptolemy.eecs.berkeley.edu/conferences/11"
  >Ninth Biennial Ptolemy Miniconference</a>,
  Berkeley, CA.

• Plain text

  Chris Shaver. "Alternative Syntactic Representations of
  Graph-Based Models". Talk or presentation,  16,
  February, 2011; Poster presented at the <a
  href="http://ptolemy.eecs.berkeley.edu/conferences/11"
  >Ninth Biennial Ptolemy Miniconference</a>,
  Berkeley, CA.

• BibTeX

  @presentation{Shaver11_AlternativeSyntacticRepresentationsOfGraphBasedModels,
      author = {Chris Shaver},
      title = {Alternative Syntactic Representations of
                Graph-Based Models},
      day = {16},
      month = {February},
      year = {2011},
      note = {Poster presented at the <a
                href="http://ptolemy.eecs.berkeley.edu/conferences/11"
                >Ninth Biennial Ptolemy Miniconference</a>,
                Berkeley, CA.},
      abstract = {Models constituted of entities connected by
                relations between ports form diagramatic
                representations of systems. Whereas these models
                are often are constructed with a point-to-point
                syntax, either graphically or lexically using
                named ports, alternative syntaxes using
                combinators offer a different perspective on
                design and an alternative codification of
                compositional information. Rather than connecting
                parts of a system with individual point-to-point
                declarations of connections, a combinator syntax
                builds up a system as an expression of
                compositions hierarchically structured in a
                functional mannar. Drawing from the expression
                syntax of Milner's Process Algebra, diagrammatic
                connections to linear algebra, and the DSP
                programming language Faust, a combinator syntax
                has been developed both as notational and a
                diagrammatic system serving the purpose of
                expressing general diagrammatic models. This
                combinator syntax can be used as a means to both
                design systems and analyze systems in a
                compositional manner. An implementation of an
                algorithm has been integrated into Ptolemy which
                forms both the graphical and textual forms of this
                combinator syntax from a large class of Ptolemy
                models.},
      URL = {http://chess.eecs.berkeley.edu/pubs/825.html}
  }
  

Posted by Christopher Brooks on 18 Feb 2011.
Groups: ptolemy
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.