*banner
 

A behavioral type system and its application in Ptolemy II
Edward A. Lee, Yuhong Xiong

Citation
Edward A. Lee, Yuhong Xiong. "A behavioral type system and its application in Ptolemy II". Formal Aspects of Computing, 16(3):210-237, August 2003.

Abstract
Interface automata [deH01] have been introduced as an interface theory [deH01a] capable of functioning as a behavioral type system. Behavioral type systems describe dynamic properties of components and their compositions. Like traditional (data) type systems, behavioral type systems can be used to check compatibility of components. In this paper, we use interface automata to devise a behavioral type system for Ptolemy II, leveraging the contravariant and optimistic properties of interface automata to achieve behavioral subtyping and polymorphism. Ptolemy II is a software framework supporting concurrent component composition according to diverse models of computation. In this paper, we focus on representing the communication protocols used in component communication within the behavioral type system. In building this type system, we identify two key limitations in interface automata formalisms; we overcome these limitations with two extensions, transient states and projection automata. In addition to static type checking, we also propose to extend the use of interface automata to the on-line reflection of component states and to run-time type checking, which enable dynamic component creation, morphing application structure, and admission control. We discuss the trade-offs in the design of behavioral type systems.

Electronic downloads

Citation formats  
  • HTML
    Edward A. Lee, Yuhong Xiong. <a
    href="http://chess.eecs.berkeley.edu/pubs/592.html"
    >A behavioral type system and its application in Ptolemy
    II</a>, <i>Formal Aspects of
    Computing</i>, 16(3):210-237, August 2003.
  • Plain text
    Edward A. Lee, Yuhong Xiong. "A behavioral type system
    and its application in Ptolemy II". <i>Formal
    Aspects of Computing</i>, 16(3):210-237, August 2003.
  • BibTeX
    @article{LeeXiong03_BehavioralTypeSystemItsApplicationInPtolemyII,
        author = {Edward A. Lee and Yuhong Xiong},
        title = {A behavioral type system and its application in
                  Ptolemy II},
        journal = {Formal Aspects of Computing},
        volume = {16},
        number = {3},
        pages = {210 - 237},
        month = {August},
        year = {2003},
        abstract = {Interface automata [deH01] have been introduced as
                  an interface theory [deH01a] capable of
                  functioning as a behavioral type system.
                  Behavioral type systems describe dynamic
                  properties of components and their compositions.
                  Like traditional (data) type systems, behavioral
                  type systems can be used to check compatibility of
                  components. In this paper, we use interface
                  automata to devise a behavioral type system for
                  Ptolemy II, leveraging the contravariant and
                  optimistic properties of interface automata to
                  achieve behavioral subtyping and polymorphism.
                  Ptolemy II is a software framework supporting
                  concurrent component composition according to
                  diverse models of computation. In this paper, we
                  focus on representing the communication protocols
                  used in component communication within the
                  behavioral type system. In building this type
                  system, we identify two key limitations in
                  interface automata formalisms; we overcome these
                  limitations with two extensions, transient states
                  and projection automata. In addition to static
                  type checking, we also propose to extend the use
                  of interface automata to the on-line reflection of
                  component states and to run-time type checking,
                  which enable dynamic component creation, morphing
                  application structure, and admission control. We
                  discuss the trade-offs in the design of behavioral
                  type systems.},
        URL = {http://chess.eecs.berkeley.edu/pubs/592.html}
    }
    

Posted by Christopher Brooks on 10 Jun 2009.
Groups: ptolemy
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