A. Girault, B. Lee, and E. A. Lee. Hierarchical finite state machines with multiple concurrency models. IEEE Transactions on ComputerAided 18(6):742--760, June 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....two modeling mechanisms. One allows designers to create actors whose behaviors are specified by FSMs. We can think of this as a graphical scripting language for writing new actors. The other one applies to modal models, which are hierarchical composition of FSMs with other models of computation [13]. For example, hybrid systems are hierarchical composition of FSM and CT models. 3.2 Composing Frameworks In order to facilitate hierarchical composition, a MoC must be compositional in the sense that it not only aggregates a network of components, it also turns that network itself into a ....

A. Girault, B. Lee, and E.A. Lee, "Hierarchical Finite State Machines with Multiple Concurrency Models," IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 18(6), 1999.

....capture concurrent execution and message passing in a system. Sometimes, it is useful to explicitly model sequential operation modes in the lifetime of the system and the transitions among these modes. For this, we introduce the notion of a modal meta model called charts (pronounced star charts) [15] that allows state machines to be composed with many concurrent models in ahierarchicalway. Figure 4 shows an example of a modal model. A composite actor, FSM, represents a finite state machine. Each state of the state machine can associate with a composite actor, which is called the refinement ....

A. Girault, B. Lee, and E. A. Lee, "Hierarchical Finite State Machines with Multiple Concurrency Models," IEEE Transaction On Computer-aided Design Of Integrated Circuits And Systems, Vol. 18, No. 6, June 1999.

....difficult to optimize systems across different models of computation. In summary, cross domain verification and optimization will remain elusive for many years for any heterogeneous modeling approach. In the following an overview of related work on mixed models of computation is given. In charts [36] hierarchical finite state machines are embedded within a variety of concurrent models of computations. The idea is to decouple the concurrency model from the hierarchical FSM semantics. An advantage is that modular components, e.g. basic FSMs, can be designed separately and composed into a system ....

A. Girault, B. Lee, and E. A. Lee. Hierarchical finite state machines with multiple concurrency models. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 18(6):742--760, June 1999.

....also been combined with differential equations, yielding the so called hybrid systems model of computation [36] The FSM domain in Ptolemy II can be hierarchically combined with other domains. We call the resulting formalism charts (pronounced starcharts ) where the star represents a wildcard [31]. Since most other domains represent concurrent computations, charts model concurrent finite state machines with a variety of concurrency semantics. When combined with CT, they yield hybrid systems and modal models. When combined with SR (described below) they yield something close to ....

....a monolithic model. Unfortunately, in all these variants FSM is combined with a particular concurrency model. The applicability of the resulting models is often limited. Based on the Ptolemy philosophy of hierarchical composition of heterogeneous models of compu tation, the charts 1 formalism [31] allows embedding hierarchical FSMs within a variety of concur rency models. If tight synchronization is possible and desirable, then FSMs can be composed by the 1. Pronounced starcharts. The star represents a wildcard that can be interpreted as matching multiple concurrency models. ....

A. Girault, B. Lee, and E. A. Lee, "Hierarchical Finite State Machines with Multiple Concurrency Models," April 13, 1998.

....Although we can model data flow in our language, we have to decide on a specific operational semantics for the data flow. This semantics will be one of several that preserves the partial ordering between operations described by the data flow specification. On the other hand Girault et al. [8] present ideas for combining different models of computation that are graphically modeled. For example they combine SDF graphs with finite state machines. Their idea is similar to ours in that they use state hierarchy to delineate models of computation. Finally we would like to point out that in ....

A. Girault, B. Lee, and E. A. Lee. Hierarchical finite state machines with multiple concurrency models. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 18(6), june 1999.

....with differential equations, yielding the so called hybrid systems model of computation [40] FSMs can be hierarchically combined with a huge variety of concurrent models of computation. We call the resulting formalism charts (pronounced starcharts ) where the star represents a wildcard [30]. Consider the model shown in figure 7. In that figure, component B is hierarchically refined by another model consisting of three components, c, d, and e. These latter three components are states of a state machine, and the connections between them are state transitions. States c and e are shown ....

....designed with the realizations that it can compose with hierarchically. This is a challenging problem. It is not always obvious what the meaning should be of some particular hierarchical combination. The semantics of various combinations of FSMs with various concurrency models are described in [30]. In Ptolemy II [20] the composition is accomplished via a notion called domain polymorphism. The term domain polymorphism requires some explanation. First, the term domain is used in the Ptolemy project to refer to an implementation of a model of computation. This implementation can be ....

[Article contains additional citation context not shown here]

A. Girault, B. Lee, and E. A. Lee, "Hierarchical Finite State Machines with Multiple Concurrency Models," IEEE Transactions On Computer-aided Design Of Integrated Circuits And Systems, Vol. 18, No. 6, June 1999.

....multidimensional DSP applications, such as those arising in image and video processing. Dynamic dataflow models include boolean dataflow and integer controlled dataflow [14, 15] and bounded dynamic dataflow [41] Metamodeling techniques relevant to dataflow include the starcharts approach [23], which provides flexible integration of finite state machine and dataflow models, and parameterized dataflow [7, 8] which provides a general mechanism for incorporating dynamic reconfiguration capabilities into arbitrary dataflow models. 2.4 Cyclo static dataflow Cyclo static dataflow (CSDF) ....

A. Girault, B. Lee, and E. A. Lee, "Hierarchical Finite State Machines with Multiple Concurrency Models," IEEE Transactions On Computer-aided Design of Integrated Circuits And Systems, Vol. 18, No. 6, June 1999.

....with differential equations, yielding the so called hybrid systems model of computation [39] FSMs can be hierarchically combined with a huge variety of concurrent models of computation. We call the resulting formalism charts (pronounced starcharts ) where the star represents a wildcard [29]. Consider the model shown in figure 4. In that figure, component B is hierarchically refined by another model consisting of three components, c, d, and e. These latter three components are states of a state machine, and the connections between them are state transitions. States c and e are shown ....

....designed with the realizations that it can compose with hierarchically. This is a challenging problem. It is not always obvious what the meaning should be of some particular hierarchical combination. The semantics of various combinations of FSMs with various concurrency models are described in [29]. In Ptolemy II [21] the composition is accomplished via a notion called domain polymorphism. In Ptolemy II, components in a concurrent model of computation implement an interface consisting of a suite of action methods. These methods define the execution of the component. A component that can ....

[Article contains additional citation context not shown here]

A. Girault, B. Lee, and E. A. Lee, "Hierarchical Finite State Machines with Multiple Concurrency Models," IEEE Transactions On Computer-aided Design Of Integrated Circuits And Systems, Vol. 18, No. 6, June 1999.

....on three small examples. Section 4 presents some of the ideas generated from the backgroud study and from the case study experiments. Finally in Section 5 a general description of the program implementing the proposed algorithms is given. 2 Background At the beginning of the stage several papers [9, 18, 17, 25, 12, 4, 5, 6, 20, 23, 22, 21, 2, 1, 14, 7, 15, 24, 19] have been studied to obtain the necessary background. In particular reviewing Dima s paper [8] proved essential for the remainder of the work and also yielded some suggestions for improvement to the author. pinello eecs.berkeley.edu 1 http: www rocq.inria.fr syndex 2 ....

A. Girault, B. Lee, and E. A. Lee, Hierarchical finite state machines with multiple concurrency models, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 18 (1999), pp. 742--760.

....semantics for integrating dataflow graphs with finite state machine (FSM) models. These include El Greco [12] which provides facilities for control models to dynamically configure specification parameters; charts (pronounced starcharts ) with heterochronous dataflow as the concurrency model [15]; the FunState intermediate representation [26] the DF framework developed at K. U. Leuven [14] and the control flow provisions in bounded dynamic dataflow [20] In contrast, parameterized dataflow does not require any departure from the dataflow framework. This is advantageous for users of DSP ....

A. Girault, B. Lee, and E. A. Lee, "Hierarchical finite state machines with multiple concurrency models," IEEE Trans. Comput.-Aided Des., vol. 18, pp. 742--760, June 1999.

....semantics for integrating dataflow graphs with finite state machine (FSM) models. These include El Greco [5] which provides facilities for control models to dynamically configure specification parameters; charts (pronounced starcharts ) with heterochronous dataflow as the concurrency model [9]; the FunState intermediate representation [17] the DF framework developed at K. U. Leuven [8] and the control flow provisions in bounded dynamic dataflow [14] In contrast, parameterized dataflow does not require any departure from the dataflow framework. This is advantageous for users of DSP ....

A. Girault, B. Lee, and E. A. Lee. Hierarchical finite state machines with multiple concurrency models. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 18(6):742-760, June 1999. 17

....in section 6. 1.1. Related work Real Time Workshop [10] is the standard software codegenerator for Simulink. It can be used for prototyping or as a basis for production code, but lacks the ability to guarantee timing. Timing is also a problem for other codegenerators, e.g. 7] Ptolemy II [5] could serve as an alternative target for the translation from Simulink. However, SPI is the more suitable model for timing analysis, as it abstracts process function into externally visible parameters. RATAN [1] analyzes satisfiability of timing constraints for an event driven process model. This ....

A. Girault, B. Lee, and E. A. Lee. Hierarchical finite state machines with multiple concurrency models. IEEE Trans. CAD, June 1999.

....The Open Toolset for Mixed Simulation of Multi domain Systems (TOOLSYS) project attempts to use VHDL AMS [18] as a means to integrate multi domain system models [2] Finally, for the design of embedded systems, several multi language simulation environments exist. Two of these are Ptolomy [17] and ClearSim MultiDomain [34] The # (or Chi) project also aims at integration of model components. However, it does this in a way complementary to the HLA, Global CAPE OPEN, TOOLSYS, Ptolomy and ClearSimMultiDomain approaches. The aim is to provide one language suited to modelling, simulation, ....

....and repetition; and advanced data modelling constructs are available. In this way, the # language is readable and usable (after getting acquainted with the basic principles) by a wide range of industrial users, while at the same time a formal semantics is available [7] The Ptolomy project [17] Multi domain modelling, simulation, and control III also includes a basic CSP based language [35] The difference with # is that, where the Ptolomy project aims at obtaining high expressivity by integrating several different languages into one modelling environment, the # project aims at ....

A. Girault, B. Lee, and E. A. Lee. Hierarchical finite state machines with multiple concurrency models. IEEE Transactions on ComputerAided Design of Integrated Circuits and Systems, 18(6):742--760, 1999.

....with differential equations, yielding the so called hybrid systems model of computation [39] FSMs can be hierarchically combined with a huge variety of concurrent models of computation. We call the result ing formalism charts (pronounced starcharts ) where the star represents a wildcard [29]. Thus, they present a promising model that is capable of abstracting program dynamics. 2.2.4 Synchronous reactive models In the synchronous reactive (SR) model of computation [10] the arcs represent data values that are aligned with global clock ticks. Thus, they are discrete signals, as with ....

....concurrent, hierarchical FSMs, but with a twist. In Statecharts, the concurrency model is fixed. Here, any concurrency model can be used. We call this generalization charts, pronounced starcharts , where the star represents a wildcard suggesting the flexibility in concurrency models [29]. Some variations of Statecharts support concurrency using models that are different from those in the original Statecharts [65] 83] As with Statecharts, concurrent composition of reflection automata provides the benefit of compact representation of a product automaton that potentially has a ....

A. Girault, B. Lee, and E. A. Lee, "Hierarchical Finite State Machines with Multiple Concurrency Models," IEEE Transactions On Computer-aided Design Of Integrated Circuits And Systems, Vol. 18, No. 6, June 1999.

No context found.

A. Girault, B. Lee, and E. A. Lee. Hierarchical finite state machines with multiple concurrency models. IEEE Transactions on ComputerAided 18(6):742--760, June 1999.

No context found.

A. Girault, B. Lee, and E. A. Lee. Hierarchical finite state machines with multiple concurrency models. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 18(6):742--760, June 1999.

No context found.

Girault, A.; Lee, B.; Lee, E.; Hierarchical finite state machines with multiple concurrency models., IEEE Transactions on CAD, Vol. 18, No. 6, pp. 742-760, June 1999.

No context found.

A. Girault, B. Lee, and E. Lee. Hierarchical finite state machines with multiple concurrency models. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, 18(6):742--760, June 1999.

No context found.

Girault, A., Lee, B., Lee, E.A.: Hierarchical finite state machines with multiple concurrency models. IEEE Transactions On Computer-aided Design Of Integrated Circuits And Systems 18 (1999)

No context found.

A. Girault, B. Lee, and E. A. Lee. Hierarchical finite state machines with multiple concurrency models. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, 18(6):742--760, June 1999.

No context found.

A. Girault, B. Lee, and E. A. Lee. Hierarchical finite state machines with multiple concurrency models. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, 18(6):742--760, June 1999.

No context found.

A. Girault, B. Lee, and E. A. Lee, "Hierarchical Finite State Machines with Multiple Concurrency Models," April 13, 1998.

No context found.

A. Girault, B. Lee, and E. A. Lee, "Hierarchical Finite State Machines with Multiple Concurrency Models," April 13, 1998.

No context found.

A. Girault, B. Lee, and E. A. Lee, "Hierarchical Finite State Machines with Multiple Concurrency Models," IEEE Transactions On Computeraided Design Of Integrated Circuits And Systems, Vol. 18, No. 6, June 1999.

No context found.

A. Girault, B. Lee, and E.A. Lee, "Hierarchical Finite State Machines with Multiple Concurrency Models," IEEE Trans. CAD Integrated Circuits and Systems, June 1999, pp. 742-760.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC