Citation
Edward A. Lee, Stavros Tripakis. "Modal Models in Ptolemy". Talk or presentation, 3, October, 2010; Workshop on Equation-Based Object-Oriented Modeling Languages and Tools, in conjunction with MODELS.

Abstract
Ptolemy is an open-source and extensible modeling and simulation framework. It offers heterogeneous modeling capabilities by allowing different models of computation to be composed hierarchically in an arbitrary fashion. This paper describes modal models, which allow to hierarchically compose finite-state machines with other models of computation, both untimed and timed. The semantics of modal models in Ptolemy are defined in a modular manner.

Electronic downloads

• ModalModels_EOOLT-1.pdf · application/pdf · 3606 kbytes
• http://chess.eecs.berkeley.edu/pubs/700.html. (Conference Paper)

• HTML

  Edward A. Lee, Stavros Tripakis. <a
  href="http://chess.eecs.berkeley.edu/pubs/708.html"
  ><i>Modal Models in Ptolemy</i></a>,
  Talk or presentation,  3, October, 2010; Workshop on
  Equation-Based Object-Oriented
  Modeling Languages and
  Tools, in conjunction with MODELS.

• Plain text

  Edward A. Lee, Stavros Tripakis. "Modal Models in
  Ptolemy". Talk or presentation,  3, October, 2010;
  Workshop on Equation-Based Object-Oriented
  Modeling
  Languages and Tools, in conjunction with MODELS.

• BibTeX

  @presentation{LeeTripakis10_ModalModelsInPtolemy,
      author = {Edward A. Lee and Stavros Tripakis},
      title = {Modal Models in Ptolemy},
      day = {3},
      month = {October},
      year = {2010},
      note = {Workshop on Equation-Based Object-Oriented
                Modeling Languages and Tools, in conjunction with
                MODELS.},
      abstract = {Ptolemy is an open-source and extensible modeling
                and simulation framework. It offers heterogeneous
                modeling capabilities by allowing different models
                of computation to be composed hierarchically in an
                arbitrary fashion. This paper describes modal
                models, which allow to hierarchically compose
                finite-state machines with other models of
                computation, both untimed and timed. The semantics
                of modal models in Ptolemy are defined in a
                modular manner.},
      URL = {http://chess.eecs.berkeley.edu/pubs/708.html}
  }
  

Posted by Mary Stewart on 11 Oct 2010.
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.