Publications related to From RM-ODP to the Formal Behavior Representation

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

Analysis of XBAR resonance and higher order spurious modes

Luis Guillermo Villanueva Torrijo, Soumya Yandrapalli, Victor Plessky

A suspended 400nm thin mono-crystalline ZY cut Lithium Niobate (LN) membrane with narrow interdigital electrodes (IDEs) on top having a pitch of the order of few microns excites standing shear bulk acoustic wave resonance (XBAR) within the membrane through ...

IEEE2019

Uncovering Latent Behaviors in Ant Colonies

Patrick Thiran, Matthias Grossglauser, Laurent Keller, Mohamed Kafsi, Raphaël Braunschweig

Many biological systems exhibit collective behaviors that strengthen their adaptability to their environment, compared to more solitary species. Describing these behaviors is challenging yet necessary in order to understand these biological systems. We pro ...

SIAM2016

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

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

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

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

From RM-ODP to the Formal Behavior Representation

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

Analysis of XBAR resonance and higher order spurious modes

Uncovering Latent Behaviors in Ant Colonies

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

For Coordination, State Component Transitions

Control design for specifications on stochastic hybrid systems

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Analysis of XBAR resonance and higher order spurious modes

Lower Bounds for Unambiguous Automata via Communication Complexity

Measuring and Synthesizing Systems in Probabilistic Environments

Uncovering Latent Behaviors in Ant Colonies

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

Integration of BIP into Connectivity Factory: Implementation

For Coordination, State Component Transitions

Control design for specifications on stochastic hybrid systems

Digital Design with Implicit State Machines