Guy Vidal-Naquet

Learn More
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order to overcome these difficulties, by allowing processors to be fractionally allocated. We prove that these representations are equivalent to the standard representations when(More)
Clear structure, support for abstraction, reuse, and easy evolution, these are the striking features of the object-oriented approach. Formal description of the reactive behavior, making it possible to prove logical correctness, is the essence of the synchronous paradigm. This paper proposes to combine these two approaches. An introductory example presents(More)
In this work, we present a framework for the semantic composition of web services based on Statecharts and uniform community service descriptions. Our model is a two step process. In the first step, we derive the execution model of the user's query. The execution model is specified in Statecharts formalism; whereas the user's query is described in OWL-S.(More)
The model driven engineering approach has had an important impact on the methods used for the conception of systems. However, some important difficult points remain in this domain. In this paper, we focus on problems related to the heterogeneity of the computation models (and therefore of the modeling techniques) used for the different aspects of a system(More)
In order to take semantical aspects into account for the scheduling problem and obtain scheduling results for a wide class of systems, we extend the Petri net scheduling approach for real-time systems. Our study focuses on tasks with conditional statements. Classical approaches consider only the worst case execution time that occurs in the different(More)
Sharing resources between multiple untrusted clients requires a shared service that provides access to the resources upon client requests. But executing these requests needs other resources, like memory or CPU time, which must be carefully allocated. In this paper, we investigate a communication mechanism that allows access to shared services without(More)