Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
A correlation-based controller tuning method is proposed for the ``Design and optimization of restricted-complexity controllers'' benchmark problem. The approach originally proposed for model following is extended to solve the disturbance rejection problem ...
The tolerance theory by Arora and Kulkarni views a fault-tolerant program as the composition of a fault-intolerant program and fault tolerance components called detectors and correctors.At its core, the theory assumes that the correctness specifications un ...
We give a process calculus model that formalizes a well-known algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failure detectors; we use our model to formally prove that the algorithm satisfies its spec ...
A benchmark problem for restricted complexity controller design is introduced. The objective is to design the lowest-order controller which meets the control specifications for an active suspension system. The input-output data of the plant are provided on ...
The number of probabilistic approaches to ``classic'' distributed systems problems such as reliable broadcast, consensus, or leader election, has further increased recently. Probabilistic algorithms, possibly starting from probabilistic system models, have ...
In this work we consider the behavioral aspects of system modeling. In order to specify the behavior of a system, many different notations can be used. Quite often, different terms in these notations are related to the same element in a system implementati ...
Program verification tools (such as model checkers and static analyzers) can find many errors in programs. These tools need formal specifications of correct program behavior, but writing a correct specification is difficult, just as writing a correct progr ...
We give a process calculus model that formalizes a well known algorithm (introduced by Chandra and Toueg) solving consensus in the presence of a particular class of failure detectors (Diamond S); we use our model to formally prove that the algorithm satisf ...
Component composition and Web-service composition have in common that the usage pattern of a certain black-box component or Web-service needs to be described precisely. Because usually many interactions between the client and the service provider are requi ...
Group communication provides communication primitives with various semantics and their use greatly simplifies the development of highly available services. However, despite tremendous advances in research and numerous prototypes, group communication stays ...