Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

New Width Inference Algorithm for Ptolemy II

Ben Lickly and Bert Rodiers

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2009-13
January 26, 2009

http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-13.pdf

In Ptolemy II, the widths of the relations between actors have an important role in specifying the semantics of a model. In some situations, however, explicit relation widths break the modularity of a model. In these cases, we would like to infer the widths of relations from the widths of neighboring relations. There is an existing implementation in Ptolemy, but it has some severe limitations. In this paper, we present the general needs for width inference in Ptolemy II, as well as the weaknesses of the current algorithm. We argue that a better algorithm is necessary, present a possible new algorithm, and analyze its performance over variety of metrics.

Author Comments: CS270 class project in fall 2008


BibTeX citation:

@techreport{Lickly:EECS-2009-13,
    Author = {Lickly, Ben and Rodiers, Bert},
    Title = {New Width Inference Algorithm for Ptolemy II},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2009},
    Month = {Jan},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-13.html},
    Number = {UCB/EECS-2009-13},
    Note = {CS270 class project in fall 2008},
    Abstract = {In Ptolemy II, the widths of the relations between actors have an important role in specifying the semantics of a model. In some situations, however, explicit relation widths break the modularity of a model. In these cases, we would like to infer the widths of relations from the widths of neighboring relations. There is an existing implementation in Ptolemy, but it has some severe limitations.

In this paper, we present the general needs for width inference in Ptolemy II, as well as the weaknesses of the current algorithm. We argue that a better algorithm is necessary, present a possible new algorithm, and analyze its performance over variety of metrics.}
}

EndNote citation:

%0 Report
%A Lickly, Ben
%A Rodiers, Bert
%T New Width Inference Algorithm for Ptolemy II
%I EECS Department, University of California, Berkeley
%D 2009
%8 January 26
%@ UCB/EECS-2009-13
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-13.html
%F Lickly:EECS-2009-13