Citation
Edward A. Lee, Stavros Tripakis. "Modal Models in Ptolemy". Proceedings of 3rd International Workshop on Equation-Based Object-Oriented Modeling Languages and Tools (EOOLT 2010), 11-22, 3, October, 2010.

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

• paper.pdf · application/pdf · 990 kbytes
• http://www.ep.liu.se/ecp/047/002/index.html. (Online version published by Linköping University Electronic Press)
• http://chess.eecs.berkeley.edu/pubs/708.html. (Presentation)

• HTML

  Edward A. Lee, Stavros Tripakis. <a
  href="http://chess.eecs.berkeley.edu/pubs/700.html"
  >Modal Models in Ptolemy</a>, Proceedings of 3rd
  International Workshop on Equation-Based Object-Oriented
  Modeling Languages and Tools (EOOLT 2010), 11-22, 3,
  October, 2010.

• Plain text

  Edward A. Lee, Stavros Tripakis. "Modal Models in
  Ptolemy". Proceedings of 3rd International Workshop on
  Equation-Based Object-Oriented Modeling Languages and Tools
  (EOOLT 2010), 11-22, 3, October, 2010.

• BibTeX

  @inproceedings{LeeTripakis10_ModalModelsInPtolemy,
      author = {Edward A. Lee and Stavros Tripakis},
      title = {Modal Models in Ptolemy},
      booktitle = {Proceedings of 3rd International Workshop on
                Equation-Based Object-Oriented Modeling Languages
                and Tools (EOOLT 2010)},
      pages = {11-22},
      day = {3},
      month = {October},
      year = {2010},
      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/700.html}
  }
  

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