Control synthesis for stochastic systems given automata specifications defined by stochastic sets
Related publications (95)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
It is clear to all, after a moments thought, that nature has much wemight be inspired by when designing our systems, for example: robustness, adaptability and complexity, to name a few. The implementation of bio-inspired systems in hardware has however bee ...
For the optimization of dynamic systems, it is customary to use measurements to combat the effect of uncertainty. In this context, an approach that consists of tracking the necessary conditions of optimality is gaining in popularity. The approach relies st ...
The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a tamper proof security module. The security modules trust each other but can only commun ...
Due to the steady tendency to propose highly customized products and to respond to volatile (i.e random) demands, Flexible Manufacturing Systems (FMS) are now present in most shopfloors. In this thesis, flexibility in a FMS is understood as the ability of ...
A new mechanism leading to scale-free networks is proposed in this Letter. It is shown that, in many cases of interest, the connectivity power-law behavior is neither related to dynamical properties nor to preferential attachment. Assigning a quenched fitn ...
We consider stochastic guarantees for networks with aggregate scheduling, in particular, Expedited Forwarding (EF). Our approach is based on the assumption that a node can be abstracted by a service curve, and the input flows are regulated individually at ...
Decision makers use bridge management systems to determine the optimal allocation of available resources. These systems are currently focused on the structural condition of deteriorating bridges with respect to traffic loads. Bridges, however, are affected ...
We are interested in running in parallel cellular automata. We present an algorithm which explores the dynamic remapping of cells in order to balance the load between processing nodes. The parallel application runs on a cluster of PCs connected by Fast-Eth ...
We consider stochastic guarantees for networks with aggregate scheduling, in particular, Expedited Forwarding (EF). Our approach is based on the assumption that a node can be abstracted by a service curve, and the input flows are regulated individually at ...
Viability and invariance problems related to a stochastic equation in a Hilbert space H are studied. Finite dimensional invariant C2 submanifolds of H are characterized. We derive Nagumo type conditions and prove a regularity result: Any weak solution, whi ...