Contents:

Ptolemy II 7.0.bet Highlights

SDF Code Generation

The SDF Template based C code generator (Codegen) generates code for hierarchical Synchronous Dataflow (SDF), Finite State Machine (FSM) and Heterochronous Dataflow Domain (HDF) models.

Codegen has the following new features:

Code Generator Documentation

References

Codegen Demonstrations

Some of the code generation demos might not work under Web Start because Web Start uses a JRE, not a JDK.

Primary Codegen Developers: Gang Zhou, Man-kit Leung.

Codegen Contributors: Christopher Brooks, Teale Fristoe, Edward A. Lee, Ye Zhou

 

Ptalon

Actor-oriented design is a common design strategy in embedded system design, where actors are concurrent components which communicate through ports by sending signals to one another. Such systems are frequently modeled with block diagrams, where the blocks represent systems and lines or arrows between blocks represent signals. Examples include Simulink, LabView, and VHDL/Verilog.

A common problem in such environments is managing complexity, particularly when the designs become large. Most actor-oriented design environments allow hierarchy, or systems (blocks) which are composed of other systems (blocks). To take this a step further, we are developing the Ptalon programming language, which allows users to parameterize components with other components.

We have developed a preliminary interpreter for the Ptalon language in the context of Ptolemy II, a general-purpose design environment for actor-oriented systems. We have also developed a mathematical framework for such languages, to help aid our understanding . We are currently investigating the resource management issues inherent in supporting large block-diagram models.

References

Ptalon Demonstrations

Backtracking

A bcktracking facility enables the system to restore its old state. It has many applications in practice, and is especially important to high-performance distributed computation.

In developing this sub-project, we highlight the following (increasing) list of criteria:

Primary Developer: Thomas Huining Feng

Backtracking Demonstrations

SDF Code Generation

The SDF Template based C code generator (Codegen) generates code for hierarchical Synchronous Dataflow (SDF), Finite State Machine (FSM) and Heterochronous Dataflow Domain (HDF) models.

Codegen has the following new features:

Codegen will not work in applets, it requires gcc and access to the local file system

Codegen chapter from the User Guide

Primary Developers: Gang Zhou, Man-kit Leung.

Contributors: Christopher Brooks, Teale Fristoe, Edward A. Lee, Ye Zhou

The Continuous domain

The Continuous Domain is a redesign of the Continuous Time (CT) domain with a rigorous semantics documented in the following papers:

The continuous domain models systems with continuous dynamics, including for example analog circuits and mechanical systems, but also cleanly supports discrete events, modal behaviors, and signals that mix continuous-time behaviors with discrete events. Models for continuous dynamics are equivalent to linear or nonlinear integral equations. A sophisticated numerical solver for these equations is integrated with the director. The clean semantics of the Continuous domain enables its integration in hierarchical heterogeneous models that use the Synchronous/Reactive (SR) and Discrete Event (DE) domains. Arbitrary hierarchical mixtures of these domains are supported, although if SR is at the top level, then the period parameter of the director must be used so that time advances. Domain interactions are documented in the following paper:

Primary Developers: Haiyang Zheng, Edward A. Lee

 

Graph Transformation

The graph transformation facility provides a framework for the analysis and transformation of actor models using graph transformation techniques.

The design of large-scale models poses a number of challenges. As the size of the models increases to thousands of actors or hundreds of thousands of actors, analysis and consistent modification on the models become extremely hard. Furthermore, to maximize component reuse, a systematic approach is needed for the specification and maintenance of common patterns in the models and the transformation of those patterns.

The model transformation framework to be developed in this project aims to support the flexible specification of patterns and replacements by means of rules in graph grammar. An intuitive graphical user interface will be built. For novice users, a set of common transformations will be included in a library to facilitate their common tasks.

The transformations are models in their own right. They can be embedded in larger models hierarchically. Heterogeneous models of computation can be used to control the application of individual "atomic" transformations. This makes it easy to create sophisticated transformations by composing simple ones in a manageable and disciplined way. The sophisticated transformations will also take advantage of the concurrency inherent in those models of computation.

Model transformation can be applied as an optimization of modal models. These are hierarchical state machines with refinements in their states, which are sub-models to be executed when those states are active. The current implementation includes the complete description of each refinement in the model description, even though refinements of the states in a state machine tend to have large commonality. With the transformation technique, only one refinement needs to be stored completely. The others are obtained by transformations performed on the stored refinement. This eliminates redundancy and eases the job of modifying multiple refinements consistently.

Other applications of the model transformation technique include recognizing common design patterns in the models in a static analysis, replacing exiting design patterns with more efficient ones, and reusing design patterns by incorporating them into new models.

References

Graph Transformation Demonstrations

The Graph Transformation facility requires WebStart or a full installation, it will not work in an applet

Primary Graph Transformation Developer: Thomas Huining Feng

New demonstrations

Continuous Time (CT)

Discrete Event (DE)

Process Network (PN)

Synchronous Dataflow (SDF)

Synchronous/Reactive (SR)

User Interface Demonstrations

Other Key New Capabilities

New and Enhanced Actor Libraries
  • New Continuous Time (CT) actors:
  • New Synchronous Dataflow (SDF) actors:

    Additional Features

    New Code Generation Actors

    Bug fixes

    Backward Compatibility

    Most models developed under Ptolemy II 1.0.1, 2.0.1, 3.0.2, 4.0.1, 5.0.2 or HyVisual 2.2-beta, 3.0, 4.0.1, 5.0.1, 6.0.2 should run under Ptolemy II 7.1.devel

    The MoMLParser includes a list of backward compatibility filters that make certain changes on models when read, handling such issues as actors being moved or renamed and parameter names being changed. The filters themselves are defined in ptolemy.moml.filter. If you have developed your own actors under earlier versions of Ptolemy II by writing your own Java files, you should recompile all your java code with the new release. In theory, copying the .class files should work, but recompiling is safer.