## Heterogeneous Concurrent Modeling and Design in Java (Volumes 1: Introduction to Ptolemy II) (2005)

### Cached

### Download Links

- [www.cs.uga.edu]
- [ptolemy.eecs.berkeley.edu]
- [www.eecs.berkeley.edu]
- [ptolemy.eecs.berkeley.edu]
- [ptolemy.eecs.berkeley.edu]
- [www.eecs.berkeley.edu]
- [ptolemy.eecs.berkeley.edu]
- [ptolemy.eecs.berkeley.edu]
- [www.eecs.berkeley.edu]
- [www.eecs.berkeley.edu]
- [www.eecs.berkeley.edu]
- [www.eecs.berkeley.edu]

Citations: | 45 - 14 self |

### BibTeX

@MISC{Brooks05heterogeneousconcurrent,

author = {Christopher Brooks and Edward A. Lee and Xiaojun Liu and Yang Zhao and Haiyang Zheng and et al.},

title = { Heterogeneous Concurrent Modeling and Design in Java (Volumes 1: Introduction to Ptolemy II) },

year = {2005}

}

### Years of Citing Articles

### OpenURL

### Abstract

### Citations

5292 |
Design Patterns: Elements of Reusable Object-Oriented Software
- Gamma, Helm, et al.
- 1994
(Show Context)
Citation Context ... scheduler to generate schedules. The classes, including the CTBaseIntegrator class and the ODESolver class, are shown in figure 2.18. Here, we use the delegation and the strategy design patterns [50]=-=[44]-=- in the CTBaseIntegrator and the ODESolver classes to support seamlessly changing ODE solvers without reconstructing integrators. The execution methods of the CTBaseIntegrator class are delegated to t... |

3410 | A theory of communicating sequential processes
- BROOKES, HOARE, et al.
- 1984
(Show Context)
Citation Context ...process can be blocked waiting to send or receive on any number of channels. It is also highly concurrent. The Rendezvous domain is based on the CSP model of computation (MoC) first proposed by Hoare =-=[61]-=-[62] in 1978. In this MoC, a system is modeled as a network of processes communicate solely by passing messages through unidirectional channels. The transfer of messages between processes is via rende... |

3217 | Communication and Concurrency - MILNER - 1989 |

2130 | Statecharts: A visual formalism for complex systems
- Harel
- 1987
(Show Context)
Citation Context ...olved by introducing hierarchical organization into FSM models and using them in combination with concurrency models. David Harel first used this approach when he introduced the Statecharts formalism =-=[52]-=-. The Statecharts formalism extends the conventional FSM model in three aspects: hierarchical decomposition of states, concurrent composition of FSMs in a synchronous-reactive fashion, and a broadcast... |

1690 | Object-Oriented Modeling and Design - Rumbaugh - 1991 |

1332 |
A Calculus of Communicating Systems
- Milner
- 1982
(Show Context)
Citation Context ... notion of nondeterministic choice. It is worth mentioning a related model of computation known as the calculus of communicating systems (CCS) that was independently developed by Robin Milner in 1980 =-=[107]-=-. The communication semantics of CSP are identical to those of CCS. The semantics of the Rendezvous domain is compatible with CSP. Extra communication primitives are provided in Rendezvous to improve ... |

1209 | Tcl and the Tk Toolkit - Ousterhout - 1994 |

1100 |
Actors: a model of concurrent computation in distributed systems
- Agha
- 1986
(Show Context)
Citation Context ...onditionalBranch[] branches = new ConditionalBranch[2]; while (continueCDO) { // step 1 guard = (_size < depth); branches[0] = new ConditionalReceive(guard, input, 0, 0); guard = (_size > 0); branches=-=[1]-=- = new ConditionalSend(guard, output, 0, 1, _buffer[_readFrom]); // step 2 int successfulBranch = chooseBranch(branches); } // step 3 if (successfulBranch == 0) { _size++; _buffer[_writeTo] = branches... |

1067 | Introduction to Lattices and Order - Davey, Priestley - 1990 |

877 | The click modular router - KOHLER, MORRIS, et al. |

786 | The Semantics of a Simple Language for Parallel Programming - Kahn - 1974 |

697 |
Parallel discrete event simulation
- Fujimoto
- 1989
(Show Context)
Citation Context ... the actors are adhered to. The DDE domain is based on distributed discrete-event processing and leverages a wealth of research devoted to this topic. Some tutorial publications on this topic are [30]=-=[43]-=-[64][109]. The DDE domain implements a specific variant of distributed discrete event systems (DDES) as expounded by Chandy and Misra [30]. The domain serves as a framework for studying DDES with two ... |

671 | The esterel synchronous programming language: Design, semantics, and implementation - Berry, Gonthier - 1992 |

635 | LEDA: a platform for combinatorial and geometric computing - Mehlhorn, aher - 1995 |

526 | Sketchpad, A Man-Machine Graphical Communication System - Sutherland - 1963 |

492 | Ptolemy: a framework for simulating and prototyping heterogeneous systems,” Readings in hardware/software co-design - Buck, Ha, et al. - 1999 |

482 | The theory of hybrid automata - Henzinger - 1996 |

482 | Static scheduling of synchronous data flow programs for digital signal processing
- Lee, Messerschmitt
- 1987
(Show Context)
Citation Context ...DF, where the data rates are fixed to be one. Heterogeneous Concurrent Modeling and Design 53SDF Domain 3.3.1 Scheduling The first step in constructing the schedule is to solve the balance equations =-=[87]-=-. These equations determine the number of times each actor will fire during an iteration. For example, consider the model in figure 3.8. This model implies the following system of equations, where Pro... |

460 | Real-Time ObjectOriented Modeling - Selic, Gullekson, et al. |

453 |
Real-Time Systems: Design Principles for Distributed Embedded Applications. Real-Time System Series
- Kopetz
- 2011
(Show Context)
Citation Context ... a DISCRETE input and a CONTINUOUS output. For domain polymorphic actors that implement the SequenceActor 1. This distinction of receivers is also called state and event semantics in some literatures =-=[70]-=-. Heterogeneous Concurrent Modeling and Design 27CT Domain interface, i.e. they operate solely on sequences of tokens, their inputs and outputs are treated as DISCRETE. For other domain polymorphic a... |

403 | Viewing control structures as patterns of passing messages - Hewitt - 1977 |

369 | The synchronous approach to reactive and real-time systems - Benveniste, Berry - 1991 |

263 | D.: Formalizing architectural connection - Allen, Garlan - 1994 |

249 | Lustre / A declarative language for programming synchronous systems - Halbwachs, Caspi, et al. - 1967 |

245 | A framework for comparing models of computation - Lee, Sangiovanni-Vincentelli - 1998 |

243 | Distributed discrete-event simulation
- Misra
- 1986
(Show Context)
Citation Context ...ors are adhered to. The DDE domain is based on distributed discrete-event processing and leverages a wealth of research devoted to this topic. Some tutorial publications on this topic are [30][43][64]=-=[109]-=-. The DDE domain implements a specific variant of distributed discrete event systems (DDES) as expounded by Chandy and Misra [30]. The domain serves as a framework for studying DDES with two special e... |

235 | An event-based architecture definition language - Luckham, Vera - 1995 |

233 |
Asynchronous distributed simulation via a sequence of parallel computations
- Chandy, Misra
- 1981
(Show Context)
Citation Context ...n of the actors are adhered to. The DDE domain is based on distributed discrete-event processing and leverages a wealth of research devoted to this topic. Some tutorial publications on this topic are =-=[30]-=-[43][64][109]. The DDE domain implements a specific variant of distributed discrete event systems (DDES) as expounded by Chandy and Misra [30]. The domain serves as a framework for studying DDES with ... |

222 | A foundation for actor computation - Agha, Mason, et al. - 1997 |

218 | CML: A higher-order concurrent language - Reppy - 1991 |

213 | Giotto: a time-triggered language for embedded programming - Henzinger, Horowitz, et al. - 2003 |

203 | Parsec: A Parallel Simulation Environment for Complex Systems." COMPUTER
- Bagrodia, Meyer
- 1998
(Show Context)
Citation Context ...n, also referred to as parallel discrete event simulation (PDES), has been an active area of research since the late 1970’s [30][43][64][109][121]. Recently there has been a resurgence of activity [8]=-=[9]-=-[16]. This is due in part to the wide availability of distributed frameworks for hosting simulations and the application of parallel simulation techniques to non-research oriented domains. For example... |

203 | et al.: Object-Oriented Modeling and Design - Rumbaugh - 1991 |

202 | Type systems, in - Cardelli - 1997 |

194 | Scheduling Dynamic Dataflow Graphs with Bounded Memory Using the Token Flow Model
- Buck
- 1993
(Show Context)
Citation Context ... of the model itself (directly related with lengths of sequences in its denotational semantics), whereas boundedness is a property of both the model and its scheduler. Buck proved in his Ph.D. thesis =-=[22]-=- that a BDF graph is Turing-complete. Since the BDF domain is a subset of the DDF domain, a DDF graph is also Turing-complete. This has the consequence that both liveness and boundedness are undecidab... |

189 | Software Synthesis from Dataflow Graphs - Bhattacharyya, Murthy, et al. - 1996 |

159 | Concurrent Object-Oriented Programming - Agha - 1990 |

155 | Object Oriented Software Construction - Meyer - 1988 |

144 |
Concurrent programming: principles and practice
- Andrews
- 1991
(Show Context)
Citation Context ...dezvous Domain blocking: i.e. the sending or receiving process stalls until the message is transferred. Some of the notation used here is borrowed from Gregory Andrews’ book on concurrent programming =-=[7]-=-, which refers to rendezvous-based message passing as synchronous message passing. Applications for the Rendezvous domain include resource management and high level system modeling early in the design... |

140 |
Simulation Model Design and Execution, Building Digital Worlds
- Fishwick
- 1995
(Show Context)
Citation Context ... 2.7 CT Domain Demos Here are some demos in the CT domain showing how this domain works and the interaction with other domains. 2.7.1 Lorenz System The Lorenz System (see, for example, pp. 213-214 in =-=[40]-=-) is a famous nonlinear dynamic system that shows chaotic attractors. The system is given by: any CT director Event Generator DE Waveform Generator FIGURE 2.5. Embedding a DE component in a CT system.... |

117 | Hierarchical Finite State Machines with Multiple Concurrency Models
- Girault, Lee, et al.
- 1999
(Show Context)
Citation Context ...hedules that represent different performance trade-offs. We anticipate that future schedulers will be implemented to take advantage of these trade-offs. For more information about these tradeoffs see =-=[47]-=-. 54 Ptolemy IISDF Domain In some cases, a non-zero solution to the balance equations does not exist. Such models are said to be inconsistent, and cannot be executed under SDF. Inconsistent graphs in... |

116 | Bounded Scheduling of Process Networks
- Parks
- 1995
(Show Context)
Citation Context ...s, then we say that the model has experienced non-timed deadlock. Non-timed deadlock is equivalent to the notion of deadlock found in bounded process networks scheduling problems as outlined by Parks =-=[120]-=-. If a non-timed deadlock is due to a model that consists solely of processes that are read blocked, then we say that a real deadlock has occurred and the model is terminated. If a non-timed deadlock ... |

114 |
M.: Comparison of Statecharts Variants
- Beeck
(Show Context)
Citation Context ...xtensions fit together was not completely specified in [52], Harel’s work stimulated a lot of interest in the approach. Consequently, there is a proliferation of variants of the Statecharts formalism =-=[12]-=-, each proposing a different way to make the extensions fit into a monolithic model. Unfortunately, in all these variants FSM is combined with a particular concurrency model. The applicability of the ... |

90 | A Theory of Type Polymorphism - Milner - 1978 |

86 | Hybrid dynamical systems theory and the signal language - Benveniste, Guernic - 1990 |

80 | Whatʹs ahead for embedded software - Lee |

79 |
Introduction to Physical Systems Dynamics
- Rosenberg
- 1983
(Show Context)
Citation Context ...wo ways to specify a continuous-time system, the conservation-law model and the signal-flow model [63]. The conservation-law models, like the nodal analysis in circuit simulation [60] and bond graphs =-=[128]-=- in mechanical models, define systems by their physical components, which specify relations of cross and through variables, and conservation laws are used to compile the component relations into globa... |

78 | The Argos language: Graphical representation of automata and description of reactive systems
- Maraninchi
- 1991
(Show Context)
Citation Context ...is information to check for local synchrony of the model and to reduce symbolic computations where possible if some rate parameters are not reconfigured. The algorithm is described more completely in =-=[102]-=-. 130 Ptolemy IIPSDF Domain 10.4 Software Architecture The PSDF kernel package implements the PSDF model of computation. The structure of this package is similar to the structure of the SDF kernel pa... |

73 | The Embedded Machine: Predictable, Portable Real-Time Code - Henzinger, Kirsch |

73 |
The modified nodal approach to network analysis
- Ho, Ruehli, et al.
- 1975
(Show Context)
Citation Context ...n There are usually two ways to specify a continuous-time system, the conservation-law model and the signal-flow model [63]. The conservation-law models, like the nodal analysis in circuit simulation =-=[60]-=- and bond graphs [128] in mechanical models, define systems by their physical components, which specify relations of cross and through variables, and conservation laws are used to compile the componen... |