Publications related to Control design for specifications on stochastic hybrid systems

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

Digital Design with Implicit State Machines

Martin Odersky, Aleksandar Prokopec, Fengyun Liu

Claude Shannon, in his famous thesis (1938), revolutionized circuit design by showing that Boolean algebra subsumes all ad-hoc methods that are used in designing switching circuits, or combinational circuits as they are commonly known today. But what is ...

2020

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

Measuring and Synthesizing Systems in Probabilistic Environments

Barbara Jobstmann, Rishabh Singh

The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under ...

Assoc Computing Machinery2015

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Jonathan Mark Scarlett

This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a ...

Institute of Electrical and Electronics Engineers2015

Formalization, Implementation, and Modeling of Institutional Controllers for Distributed Robotic Systems

Alcherio Martinoli, José Nuno Ferreira Maia Pereira

The work described is part of a long term program of introducing institutional robotics, a novel framework for the coordination of robot teams that stems from institutional economics concepts. Under the framework, institutions are cumulative sets of persis ...

Mit Press2014

For Coordination, State Component Transitions

Simon Bliudze, Anastasia Mavridou, Radoslaw Szymanek, Alina Zolotukhina

Coordinating component behaviour and, in particular, concurrent access to resources is among the key difficulties of building large concurrent systems. To address this, developers must be able to manipulate high-level concepts, such as Finite State Machine ...

2013

Integration of BIP into Connectivity Factory: Implementation

Simon Bliudze, Anastasia Mavridou, Radoslaw Szymanek, Alina Zolotukhina

Coordinating component behaviour and, in particular, concurrent access to resources is among the key difficulties of building large concurrent systems. To address this, developers must be able to manipulate high-level concepts, such as Finite State Machine ...

2013

Stochastic system controller synthesis for reachability specifications encoded by random sets

Maryam Kamgarpour, John Lygeros

We consider a reach–avoid specification for a stochastic hybrid dynamical system defined as reaching a goal set at some finite time, while avoiding an unsafe set at all previous times. In contrast with earlier works which consider the target and avoid sets ...

2013

The Kaldi Speech Recognition Toolkit

Petr Motlicek

We describe the design of Kaldi, a free, open-source toolkit for speech recognition research. Kaldi provides a speech recognition system based on finite-state automata (using the freely available OpenFst), together with detailed documentation and a compreh ...

Idiap2012

Control design for specifications on stochastic hybrid systems

Graph Chatbot

Chat with Graph Search

Lower Bounds for Unambiguous Automata via Communication Complexity

Digital Design with Implicit State Machines

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Measuring and Synthesizing Systems in Probabilistic Environments

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Formalization, Implementation, and Modeling of Institutional Controllers for Distributed Robotic Systems

For Coordination, State Component Transitions

Integration of BIP into Connectivity Factory: Implementation

Stochastic system controller synthesis for reachability specifications encoded by random sets

The Kaldi Speech Recognition Toolkit

Lower Bounds for Unambiguous Automata via Communication Complexity

Measuring and Synthesizing Systems in Probabilistic Environments

Formalization, Implementation, and Modeling of Institutional Controllers for Distributed Robotic Systems

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

For Coordination, State Component Transitions

Integration of BIP into Connectivity Factory: Implementation

Stochastic system controller synthesis for reachability specifications encoded by random sets

The Kaldi Speech Recognition Toolkit

Digital Design with Implicit State Machines