Almost ASAP semantics: from timed models to timed implementations

From Timed Models to Timed Implementations

Computer Science is currently facing a grand challenge : finding good design practices for embedded systems. Embedded systems are essentially computers interacting with some physical process. You could find one in a braking systems or in a nuclear power plant for example. They present several design difficulties : first they are reactive systems, interacting indefinitely with their environment....

From Causal Semantics To Duration Timed Models

The interleaving semantics is not compatible with both action refinement and durational actions. Since many true concurrency semantics are congruent w.r.t. action refinement, notably the causality and the maximality ones [4, 5], this has challenged us to study the dense time behavior where the actions are of arbitrary fixed duration within the causality semantics of Da Costa [4]. We extend the ...

On Almost Deterministic Timed Automata

From Timed Automata to Devs Models

In this paper, we present the formal transformation of Timed Input/Output Automata into simulation models, expressed in the DEVS formalism. This transformation takes place in an approach of a validation of high-level specifications by simulation. The validation is based on the simulation of a coupled model built with the system to be controlled and the control specifications. An example of this...

Semantics of Timed Concurrent Systems

A truly concurrent and timeless semantics is proposed for a composition of sequential, non-deterministic processes with asynchronous communication. It is shown when this semantics differs from simple interleaving. Implementation-dependent time constraints determine a subset of all computations of the timeless semantics. This set is precisely characterized for given constraints. It is shown how ...