Concept
Probabilistic automaton
Related publications (15)
TFHE: Fast Fully Homomorphic Encryption Over the Torus
This work describes a fast fully homomorphic encryption scheme over the torus (TFHE) that revisits, generalizes and improves the fully homomorphic encryption (FHE) based on GSW and its ring variants. The simplest FHE schemes consist in bootstrapped binary ...
SPRINGER2020Formalization, 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 Press2014Control design for specifications on stochastic hybrid systems
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 ...
2012Quantitative Languages
Quantitative generalizations of classical languages, which assign to each word a real number instead of a Boolean value, have applications in modeling resource-constrained computation. We use weighted automata (finite automata with transition weights) to d ...
2010