*banner
 

A Modular Formal Semantics for Ptolemy
Stavros Tripakis, Christos Stergiou, Chris Shaver, Edward A. Lee

Citation
Stavros Tripakis, Christos Stergiou, Chris Shaver, Edward A. Lee. "A Modular Formal Semantics for Ptolemy". Mathematical Structures in Computer Science. Accepted for publication, 2012.

Abstract
Ptolemy is an open-source and extensible modeling and simulation framework. It offers heterogeneous modeling capabilities by allowing different models of computation, both untimed and timed, to be composed hierarchically in an arbitrary fashion. This paper proposes a formal semantics for Ptolemy which is modular, in the sense that atomic actors and their compositions are treated in a unified way. In particular, all actors conform to an executable interface that contains four functions: fire (produce outputs given current state and inputs), postfire (update state instantaneously), deadline (how much time the actor is willing to let elapse) and time-update (update state with passage of time). Composite actors are obtained from composition operators that in Ptolemy are called directors. Different directors realize different models of computation. This paper defines formally the directors for the following models of computation: Synchronous-Reactive, Discrete Event, Continuous Time, Process Networks, and Modal Models.

Electronic downloads

Citation formats  
  • HTML
    Stavros Tripakis, Christos Stergiou, Chris Shaver, Edward A.
    Lee. <a
    href="http://chess.eecs.berkeley.edu/pubs/877.html"
    >A Modular Formal Semantics for Ptolemy</a>,
    <i>Mathematical Structures in Computer Science.
    Accepted for publication</i>,  2012.
  • Plain text
    Stavros Tripakis, Christos Stergiou, Chris Shaver, Edward A.
    Lee. "A Modular Formal Semantics for Ptolemy".
    <i>Mathematical Structures in Computer Science.
    Accepted for publication</i>,  2012.
  • BibTeX
    @article{TripakisStergiouShaverLee12_ModularFormalSemanticsForPtolemy,
        author = {Stavros Tripakis and Christos Stergiou and Chris
                  Shaver and Edward A. Lee},
        title = {A Modular Formal Semantics for Ptolemy},
        journal = {Mathematical Structures in Computer Science.
                  Accepted for publication},
        year = {2012},
        abstract = {Ptolemy is an open-source and extensible modeling
                  and simulation framework. It offers heterogeneous
                  modeling capabilities by allowing different models
                  of computation, both untimed and timed, to be
                  composed hierarchically in an arbitrary fashion.
                  This paper proposes a formal semantics for Ptolemy
                  which is modular, in the sense that atomic actors
                  and their compositions are treated in a unified
                  way. In particular, all actors conform to an
                  executable interface that contains four functions:
                  fire (produce outputs given current state and
                  inputs), postfire (update state instantaneously),
                  deadline (how much time the actor is willing to
                  let elapse) and time-update (update state with
                  passage of time). Composite actors are obtained
                  from composition operators that in Ptolemy are
                  called directors. Different directors realize
                  different models of computation. This paper
                  defines formally the directors for the following
                  models of computation: Synchronous-Reactive,
                  Discrete Event, Continuous Time, Process Networks,
                  and Modal Models.},
        URL = {http://chess.eecs.berkeley.edu/pubs/877.html}
    }
    

Posted by Stavros Tripakis on 17 Nov 2011.
Groups: actionwebs
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

©2002-2018 Chess