Concept

Automate

Publications associées (16)

Lower Bounds for Unambiguous Automata via Communication Complexity

We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results. 1) Complement: There is a language L recognised by an n-state UFA such that the complement language ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022

Control synthesis for stochastic systems given automata specifications defined by stochastic sets

Maryam Kamgarpour, John Lygeros, Tony Alan Wood

The problem of control synthesis to maximize the probability of satisfying automata specifications for systems with uncertainty is addressed. Two types of uncertainty are considered; stochasticity in the dynamical system and in the sets defining the specif ...

2017

EXiO-A Brain-Controlled Lower Limb Exoskeleton for Rhesus Macaques

Hannes Bleuler, Mohamed Bouri, Jeremy Olivier, Miguel Nicolelis, Tristan Hubert Vouga

Recent advances in the field of brain-machine interfaces (BMIs) have demonstrated enormous potential to shape the future of rehabilitation and prosthetic devices. Here, a lower-limb exoskeleton controlled by the intracortical activity of an awake behaving ...

Ieee-Inst Electrical Electronics Engineers Inc2017

Representation of Medical Guidelines with a Computer Interpretable Model

Giovanni De Micheli, Alena Simalatsar, Wenqi You Dubout

Nowadays medical software is tightly coupled with medical devices that perform patient state monitoring and lately even some basic treatment procedures. Medical guidelines (GLs) can be seen as specification of a medical system which requires their computer ...

World Scientific Publ Co Pte Ltd2014

Uniform Analysis for Communicating Timed Systems (Extended Technical Report)

Hossein Hojjat

Languages based on the theory of timed automata are a well established approach for modelling and analysing real-time systems, with many applications both in an industrial and academic context. Model checking for timed automata has been studied extensively ...

2013

A Control Flow Prototype for a Dose Recommending Device for Chronic Myeloid Leukemia Patients

Giovanni De Micheli, Alena Simalatsar, Wenqi You Dubout, Dechao Sun

In this paper we present a prototype of a control flow for an a posteriori drug dose adaptation for Chronic Myelogenous Leukemia (CML) patients. The control flow is modeled using Timed Automata extended with Tasks (TAT) model. The feedback loop of the cont ...

2013

Medical Guidelines Reconciling Medical Software and Electronic Devices: Imatinib Case-study

Giovanni De Micheli, Alena Simalatsar

Ieee2012

TAT-based Formal Representation of Medical Guidelines : Imatinib Case-study

Giovanni De Micheli, Alena Simalatsar

Computer-based interpretation of medical guide- lines (GLs) has drawn lots of attention in the past three decades. It is essential to use a formalism for GLs representation that would enable the validation of GLs structural properties, be able to map medic ...

Ieee2012

Robust safety of timed automata

Laurent Doyen

Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturbation in the timing of actions may lead to completely different behaviors of ...

Springer US2008

Expressiveness and Closure Properties for Quantitative Languages

Laurent Doyen

Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the ma ...

2008

Graph Chatbot

Chattez avec Graph Search

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.

Connectez-vous pour utiliser Chat avec Graph Search