DE SIMONE , Robert

Résumé disponible sur le PDF

Embedded and Cyber-Physical systems pose new demands on modeling and simulation aspects. To the architectural and functional representation of (discrete/cyber) execution platform and running application, one must also associate extra-functional representations for the (possibly continuous) physical environment, as well as power and thermal...

The UML Profile for Modeling and Analysis of Real-Time and Embedded systems promises a general modeling framework to design and analyze systems. Lots of works have been published on the modeling capabilities offered by MARTE, much less on available verification techniques. The Clock Constraint Specification Language (CCSL), first introduced as...

A cellular automaton (CA) is an infinite array of cells, each containing the same automaton. The dynamics of a CA is distributed over the cells where each computes its next state as a function of the previous states of its neighborhood. Thus, the transmission of such states between neighbors is considered as feasible directly, in no time. When...

Several efficient compilation techniques have been recently proposed for the generation of sequential (C) code from Esterel programs. Consisting essentially in direct simulation of the reactive features of the language, these techniques need now to be accommodated with traditional issues of Esterel - the definition of formal semantics, the...

Disponible dans les fichiers attachés à ce document

Disponible dans les fichiers attachés à ce document

The search for optimal mapping of application (tasks) onto processor architecture (resources) is always an acute issue, as new types of heterogeneous multicore architectures are being proposed constantly. The physical allocation and temporal scheduling can be attempted at a number of levels, from abstract mathematical models and operational...

Real-time embedded applications tend to combine periodic and aperiodic computations. Modeling standardsmust then support both discrete-time and discrete-event models of computation and communication whereas they historically pertain to two different communities: asynchronous and synchronous designers. In this article, two emerging standards of...

We present a new synchronous programming language named \Name{SL} based on \Name{Esterel}, in which hypothesis about signal presences or absences are not allowed. Thus, one can decide that a signal was absent during one instant only at the end of this instant, and so reaction to this absence is delayed. \Name{Esterel} «causality problems» are...

Massively Parallel Processor Array (MPPA) architectures are becoming widely available computing platforms. Because of formal similarities, they are good candidates for implementing Cellular Automata (CA). An essential difference still remains regarding the freedom in communications. In MPPA there is a fixed on-chip network interconnection...

The design of embedded platforms for connected objects (smartphones and beyond) is made harder because such systems must satisfy stringent constraint beyond functional correctness and accuracy. Namely, extra-functional requirements such as performance, power consumption and thermal dissipation are equally important, while there are important...

Massively Parallel Processor Array (MPPA) architectures are becoming widely available computing platforms. Because of formal similarities, they are good candidates for implementing Cellular Automata (CA). An essential difference still remains regarding the freedom in communications. In MPPA there is a fixed on-chip network interconnection...

Disponible dans les fichiers attachés à ce document

This report presents an algorithm to statically schedule live and strongly connected Marked Graphs (MG). The proposed algorithm computes the best execution where the execution rate is maximal and place sizes are minimal. The proposed algorithm provides transition schedules represented as binary words. These words are chosen to be balanced. The...

As its name promises, the Unified Modeling Language (UML) provides a collection of diagrammatic modeling styles. To the early class/objects and use-case diagrams were almost immediately added state-, activity-, collaboration-, and component diagrams. All these modeling views, required for structural and behavioral representations of systems,...

This paper presents an algorithm to statically schedule live and strongly connected Marked Graphs. The proposed algorithm computes the best execution where the execution rate is maximal and place sizes are minimal. The proposed algorithm provides transition schedules represented as binary words. These words are chosen to be balanced. The...

We introduce K-periodically Routed Graphs, which are extensions of Marked Graphs with routing nodes, governed by ultimately periodic binary sequences. We study data relations and dependencies, as well as equational transformations of the network topology. We show the existence of expanded normal forms. We prove that some transformations...