Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Almagor, S., Boker, U., Kupferman, O.: What’s Decidable about Weighted Automata? In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 482–491. Springer, Heidelberg (2011)
Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: Proc. 25th STOC, pp. 592–601 (1993)
Avni, G., Kupferman, O.: Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 84–99. Springer, Heidelberg (2012)
Bruns, G., Godefroid, P.: Temporal logic query checking. In: Proc. 16th LICS, pp. 409–420 (2001)
Chan, W.: Temporal-logic Queries. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 450–463. Springer, Heidelberg (2000)
Chatterjee, K., Doyen, L., Henzinger, T.: Quantitative Languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 385–400. Springer, Heidelberg (2008)
Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. LMCS 6(3) (2010)
Culik, K., Kari, J.: Digital images and formal languages. In: Handbook of Formal Languages: Beyond words, vol. 3, pp. 599–616 (1997)
Dijkstra, E.W.: A Discipline of Programming. Prentice Hall (1976)
Fix, L., Francez, N., Grumberg, O.: Program Composition and Modular Verification. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 93–114. Springer, Heidelberg (1991)
Filiot, E., Gentilini, R., Raskin, J.-F.: Quantitative Languages Defined by Functional Automata. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 132–146. Springer, Heidelberg (2012)
Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169–197 (1981)
Grötschel, M., Lovász, L., Schrijver, A.: Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization”. Combinatorica 4(4) (1984)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer (1988)
Jobstmann, B., Griesmayer, A., Bloem, R.: Program Repair as a Game. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 226–238. Springer, Heidelberg (2005)
Karp, R., Papadimitriou, C.: On linear characterizations of combinatorial optimization problems. In: Proc. 21st FOCS, pp. 1–9 (1980)
Khachiyan, L.G.: A polynomial algorithm in linear programming. Doklady Akademii Nauk SSSR 244, 1093–1096 (1979)
Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. International Journal of Algebra and Computation 4(3), 405–425 (1994)
Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23(2), 269–311 (1997)
Mohri, M., Pereira, F.C.N., Riley, M.: Weighted finite-state transducers in speech recognition. Computer Speech and Language 16(1), 69–88 (2002)
Padberg, M.W., Rao, M.R.: The Russian Method and Integer Programming. Working paper series. Salomon Brothers Center for the Study of Financial Institutions (1980)
Schrijver, A.: Theory of linear and integer programming. Wiley-Interscience series in discrete mathematics and optimization. Wiley (1999)
Solar-Lezama, A., Rabbah, R.M., Bodík, R., Ebcioglu, K.: Programming by sketching for bit-streaming programs. In: PLDI, pp. 281–294 (2005)
Thomas, W.: Automata on infinite objects. Handbook of Theoretical Computer Science, 133–191 (1990)
Thorup, M.: Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 384–396. Springer, Heidelberg (2004)
Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. I& C 115(1), 1–37 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avni, G., Kupferman, O. (2013). Parameterized Weighted Containment. In: Pfenning, F. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2013. Lecture Notes in Computer Science, vol 7794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37075-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-37075-5_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37074-8
Online ISBN: 978-3-642-37075-5
eBook Packages: Computer ScienceComputer Science (R0)