Publications related to From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata

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

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

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

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

Control design for specifications on stochastic hybrid systems

Maryam Kamgarpour

We synthesize controllers for discrete-time stochastic hybrid systems such that the probability of satisfying a given specification on the system is maximized. The specifications are defined with finite state automata. It is shown that automata satisfactio ...

2012

Symbolic execution of Reo circuits using constraint automata

Hossein Hojjat

Reo is a coordination language that can be used to model different systems. We propose a technique for symbolic execution of Reo circuits using the symbolic representation of data constraints in Constraint Automata. This technique enables us to obtain the ...

2012

From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata

Graph Chatbot

Chat with Graph Search

Lower Bounds for Unambiguous Automata via Communication Complexity

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

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

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

Control design for specifications on stochastic hybrid systems

Symbolic execution of Reo circuits using constraint automata

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

Symbolic execution of Reo circuits using constraint automata

Lower Bounds for Unambiguous Automata via Communication Complexity

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

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

Measuring and Synthesizing Systems in Probabilistic Environments

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

Integration of BIP into Connectivity Factory: Implementation

Control design for specifications on stochastic hybrid systems

For Coordination, State Component Transitions