Program composition and modular verification
Proceedings of the 18th international colloquium on Automata, languages and programming
Handbook of theoretical computer science (vol. B)
Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Reasoning about infinite computations
Information and Computation
Digital images and formal languages
Handbook of formal languages, vol. 3
A Discipline of Programming
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Finite-state transducers in language and speech processing
Computational Linguistics
Programming by sketching for bit-streaming programs
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
On linear characterizations of combinatorial optimization problems
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
What's decidable about weighted automata?
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Making weighted containment feasible: a heuristic based on simulation and abstraction
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Automatic vandalism detection in wikipedia with active associative classification
TPDL'12 Proceedings of the Second international conference on Theory and Practice of Digital Libraries
Automatic generation of quality specifications
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Hi-index | 0.00 |
Partially-specified systems and specifications are used in formal methods such as stepwise design and query checking. Existing methods consider a setting in which the systems and their correctness are Boolean. In recent years there has been growing interest and need for quantitative formal methods, where systems may be weighted and specifications may be multi valued. Weighted automata, which map input words to a numerical value, play a key role in quantitative reasoning. Technically, every transition in a weighted automaton $\mathcal{A}$ has a cost, and the value $\mathcal{A}$ assigns to a finite word w is the sum of the costs on the transitions participating in the most expensive accepting run of $\mathcal{A}$ on w. We study parameterized weighted containment: given three weighted automata $\mathcal{A}, \mathcal{B}$, and $\mathcal{C}$, with $\mathcal{B}$ being partial, the goal is to find an assignment to the missing costs in $\mathcal{B}$ so that we end up with $\mathcal{B}'$ for which $\mathcal{A} \leq \mathcal{B}' \leq \mathcal{C}$, where ≤ is the weighted counterpart of containment. We also consider a one-sided version of the problem, where only $\mathcal{A}$ or only $\mathcal{C}$ are given in addition to $\mathcal{B}$, and the goal is to find a minimal assignment with which $\mathcal{A} \leq B'$ or, respectively, a maximal one with which $\mathcal{B}' \leq \mathcal{C}$. We argue that both problems are useful in stepwise design of weighted systems as well as approximated minimization of weighted automata. We show that when the automata are deterministic, we can solve the problems in polynomial time. Our solution is based on the observation that the set of legal assignments to k missing costs forms a k-dimensional polytope. The technical challenge is to find an assignment in polynomial time even though the polytope is defined by means of exponentially many inequalities. We do so by using a powerful mathematical tool that enables us to develop a divide-and-conquer algorithm based on a separation oracle for polytopes. For nondeterministic automata, the weighted setting is much more complex, and in fact even non-parameterized containment is undecidable. We are still able to study variants of the problems, where containment is replaced by simulation.