133 research outputs found
When is Containment Decidable for Probabilistic Automata?
The containment problem for quantitative automata is the natural quantitative generalisation of the classical language inclusion problem for Boolean automata. We study it for probabilistic automata, where it is known to be undecidable in general. We restrict our study to the class of probabilistic automata with bounded ambiguity. There, we show decidability (subject to Schanuel's conjecture) when one of the automata is assumed to be unambiguous while the other one is allowed to be finitely ambiguous. Furthermore, we show that this is close to the most general decidable fragment of this problem by proving that it is already undecidable if one of the automata is allowed to be linearly ambiguous
Placing regenerators in optical networks to satisfy multiple sets of requests.
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, regenerators must be placed in such a way that in any lightpath there are no more than d hops without meeting a regenerator. While most of the research has focused on heuristics and simulations, the first theoretical study of the problem has been recently provided in [10], where the considered cost function is the number of locations in the network hosting regenerators. Nevertheless, in many situations a more accurate estimation of the real cost of the network is given by the total number of regenerators placed at the nodes, and this is the cost function we consider. Furthermore, in our model we assume that we are given a finite set of p possible traffic patterns (each given by a set of lightpaths), and our objective is to place the minimum number of regenerators at the nodes so that each of the traffic patterns is satisfied. While this problem can be easily solved when d = 1 or p = 1, we prove that for any fixed d,p ≥ 2 it does not admit a PTASUnknown control sequence '\textsc', even if G has maximum degree at most 3 and the lightpaths have length O(d)(d). We complement this hardness result with a constant-factor approximation algorithm with ratio ln (d ·p). We then study the case where G is a path, proving that the problem is NP-hard for any d,p ≥ 2, even if there are two edges of the path such that any lightpath uses at least one of them. Interestingly, we show that the problem is polynomial-time solvable in paths when all the lightpaths share the first edge of the path, as well as when the number of lightpaths sharing an edge is bounded. Finally, we generalize our model in two natural directions, which allows us to capture the model of [10] as a particular case, and we settle some questions that were left open in [10]
Revisiting Synthesis for One-Counter Automata
We study the (parameter) synthesis problem for one-counter automata with
parameters. One-counter automata are obtained by extending classical
finite-state automata with a counter whose value can range over non-negative
integers and be tested for zero. The updates and tests applicable to the
counter can further be made parametric by introducing a set of integer-valued
variables called parameters. The synthesis problem for such automata asks
whether there exists a valuation of the parameters such that all infinite runs
of the automaton satisfy some omega-regular property. Lechner showed that (the
complement of) the problem can be encoded in a restricted one-alternation
fragment of Presburger arithmetic with divisibility. In this work (i) we argue
that said fragment, called AERPADPLUS, is unfortunately undecidable.
Nevertheless, by a careful re-encoding of the problem into a decidable
restriction of AERPADPLUS, (ii) we prove that the synthesis problem is
decidable in general and in N2EXP for several fixed omega-regular properties.
Finally, (iii) we give a polynomial-space algorithm for the special case of the
problem where parameters can only be used in tests, and not updates, of the
counter
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket
We study wear-leveling techniques for cuckoo hashing, showing that it is
possible to achieve a memory wear bound of after the
insertion of items into a table of size for a suitable constant
using cuckoo hashing. Moreover, we study our cuckoo hashing method empirically,
showing that it significantly improves on the memory wear performance for
classic cuckoo hashing and linear probing in practice.Comment: 13 pages, 1 table, 7 figures; to appear at the 13th Symposium on
Experimental Algorithms (SEA 2014
Recommended from our members
Containment and equivalence of weighted automata: Probabilistic and max-plus cases
This paper surveys some results regarding decision problems for probabilistic and max-plus automata, such as containment and equivalence. Probabilistic and max-plus automata are part of the general family of weighted automata, whose semantics are maps from words to real values. Given two weighted automata, the equivalence problem asks whether their semantics are the same, and the containment problem whether one is point-wise smaller than the other one. These problems have been studied intensively and this paper will review some techniques used to show (un)decidability and state a list of open questions that still remain
Pattern graph rewrite systems
String diagrams are a powerful tool for reasoning about physical processes,
logic circuits, tensor networks, and many other compositional structures.
Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric
representations of string diagrams, amenable to automated reasoning about
diagrammatic theories via graph rewrite systems. In this extended abstract, we
show how the power of such rewrite systems can be greatly extended by
introducing pattern graphs, which provide a means of expressing infinite
families of rewrite rules where certain marked subgraphs, called !-boxes ("bang
boxes"), on both sides of a rule can be copied any number of times or removed.
After reviewing the string graph formalism, we show how string graphs can be
extended to pattern graphs and how pattern graphs and pattern rewrite rules can
be instantiated to concrete string graphs and rewrite rules. We then provide
examples demonstrating the expressive power of pattern graphs and how they can
be applied to study interacting algebraic structures that are central to
categorical quantum mechanics.Comment: In Proceedings DCM 2012, arXiv:1403.757
A Regular and Complete Notion of Delay for Streaming String Transducers
The notion of delay between finite transducers is a core element of numerous fundamental results of transducer theory. The goal of this work is to provide a similar notion for more complex abstract machines: we introduce a new notion of delay tailored to measure the similarity between streaming string transducers (SST). We show that our notion is regular: we design a finite automaton that can check whether the delay between any two SSTs executions is smaller than some given bound. As a consequence, our notion enjoys good decidability properties: in particular, while equivalence between non-deterministic SSTs is undecidable, we show that equivalence up to fixed delay is decidable. Moreover, we show that our notion has good completeness properties: we prove that two SSTs are equivalent if and only if they are equivalent up to some (computable) bounded delay. Together with the regularity of our delay notion, it provides an alternative proof that SSTs equivalence is decidable. Finally, the definition of our delay notion is machine-independent, as it only depends on the origin semantics of SSTs. As a corollary, the completeness result also holds for equivalent machine models such as deterministic two-way transducers, or MSO transducers
- …