Expressiveness And Closure Properties For Quantitative Languages
Related publications (40)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We consider the problem of finding the optimal time to switch between two measurable cash-flow streams. A complete characterization of the set of solutions is obtained in terms of adjoint variables which measure the available gain from deviations. An itera ...
Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...
2017
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 ...
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
, ,
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
,
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
,
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
The special linear group G = SLn(Z[x(1), ... , x(k)]) (n at least 3 and k finite) is called the universal lattice. Let n be at least 4, and p be any real number in (1, infinity). The main result is the following: any finite index subgroup of G has the fixe ...
The aim of this paper is to give upper bounds for the Euclidean minima of abelian fields of odd prime power conductor. In particular, these bounds imply Minkowski's conjecture for totally real number fields of conductor p(r), where p is an odd prime number ...
We consider the problem of finding the optimal time to switch between two measurable cash-flow streams. A complete characterization of the set of solutions is obtained in terms of adjoint variables which measure the available gain from deviations. An itera ...
