1,082,077 research outputs found
IST Austria Technical Report
We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural properties that arise in program analysis.
We consider that each component of the concurrent system is a graph with constant treewidth, and it is known that the controlflow graphs of most programs have constant treewidth. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis problems (e.g., alias analysis). The study of multiple queries allows us to consider the tradeoff between the resource usage of the \emph{one-time} preprocessing and for \emph{each individual} query. The traditional approaches construct the product graph of all components and apply the best-known graph algorithm on the product. In the traditional approach, even the answer to a single query requires the transitive closure computation (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.
Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time,
each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results that show that the worst-case running times of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (such as improving
the worst-case bounds for the shortest path problem in general graphs whose current best-known bound has not been improved in five decades). Finally, we provide a prototype implementation of our algorithms which significantly outperforms the existing algorithmic methods on several benchmarks
Not every pseudoalgebra is equivalent to a strict one
We describe a finitary 2-monad on a locally finitely presentable 2-category
for which not every pseudoalgebra is equivalent to a strict one. This shows
that having rank is not a sufficient condition on a 2-monad for every
pseudoalgebra to be strictifiable. Our counterexample comes from higher
category theory: the strict algebras are strict 3-categories, and the
pseudoalgebras are a type of semi-strict 3-category lying in between
Gray-categories and tricategories. Thus, the result follows from the fact that
not every Gray-category is equivalent to a strict 3-category, connecting
2-categorical and higher-categorical coherence theory. In particular, any
nontrivially braided monoidal category gives an example of a pseudoalgebra that
is not equivalent to a strict one.Comment: 17 pages; added more explanation; final version, to appear in Adv.
Mat
IST Austria Technical Report
We consider partially observable Markov decision processes (POMDPs) with a set of target states and every transition is associated with an integer cost. The optimization objective we study asks to minimize the expected total cost till the target set is reached, while ensuring that the target set is reached almost-surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost and the bound is double exponential; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst-case running time of our algorithm is double exponential, we also present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples of interest
A note on nowhere-zero 3-flow and Z_3-connectivity
There are many major open problems in integer flow theory, such as Tutte's
3-flow conjecture that every 4-edge-connected graph admits a nowhere-zero
3-flow, Jaeger et al.'s conjecture that every 5-edge-connected graph is
-connected and Kochol's conjecture that every bridgeless graph with at
most three 3-edge-cuts admits a nowhere-zero 3-flow (an equivalent version of
3-flow conjecture). Thomassen proved that every 8-edge-connected graph is
-connected and therefore admits a nowhere-zero 3-flow. Furthermore,
Lovsz, Thomassen, Wu and Zhang improved Thomassen's result to
6-edge-connected graphs. In this paper, we prove that: (1) Every
4-edge-connected graph with at most seven 5-edge-cuts admits a nowhere-zero
3-flow. (2) Every bridgeless graph containing no 5-edge-cuts but at most three
3-edge-cuts admits a nowhere-zero 3-flow. (3) Every 5-edge-connected graph with
at most five 5-edge-cuts is -connected. Our main theorems are partial
results to Tutte's 3-flow conjecture, Kochol's conjecture and Jaeger et al.'s
conjecture, respectively.Comment: 10 pages. Typos correcte
Properties of minimally -tough graphs
A graph is minimally -tough if the toughness of is and the
deletion of any edge from decreases the toughness. Kriesell conjectured
that for every minimally -tough graph the minimum degree . We
show that in every minimally -tough graph . We
also prove that every minimally -tough claw-free graph is a cycle. On the
other hand, we show that for every any graph can be embedded
as an induced subgraph into a minimally -tough graph
- …