Krishnendu Chatterjee
Abstract
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 a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification under the input assumption, synthesize a system that optimizes the measured value.
For safety specifications and quantitative measures that are defined by mean-payoff automata, the optimal synthesis problem reduces to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be achieved in polynomial time. For general omega-regular specifications along with mean-payoff automata, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. Our algorithm constructs optimal strategies that consist of two memoryless strategies and a counter. The counter is in general not bounded. To obtain a finite-state system, we show how to construct an ϵ-optimal strategy with a bounded counter, for all ϵ > 0. Furthermore, we show how to decide in polynomial time if it is possible to construct an optimal finite-state system (i.e., a system without a counter) for a given specification.
We have implemented our approach and the underlying algorithms in a tool that takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. We present some experimental results showing optimal systems that were automatically generated in this way.
- R. Alur, A. Degorre, O. Maler, and G. Weiss. 2009. On omega-languages defined by mean-payoff conditions. In Proceedings of FOSSACS. Lecture Notes in Computer Science, vol. 5504, Springer, 333--347. Google Scholar
Digital Library
- C. Baier, M. Grösser, M. Leucker, B. Bollig, and F. Ciesinski. 2004. Controller synthesis for probabilistic systems. In Proceedings of IFIP TCS. Kluwer, 493--506.Google Scholar
- C. Baier and J.-P. Katoen. 2008. Principles of Model Checking (Representation and Mind Series). MIT Press. Google ScholarDigital Library
- A. Bianco and L. de Alfaro. 1995. Model checking of probabilistic and nondeterministic systems. In Proceedings of FSTTCS 95. Lecture Notes in Computer Science, vol. 1026, Springer, 499--513. Google ScholarDigital Library
- P. Billingsley, Ed. 1995. Probability and Measure. Wiley-Interscience.Google Scholar
- R. Bloem, K. Chatterjee, T. Henzinger, and B. Jobstmann. 2009a. Better quality in synthesis through quantitative objectives. In Proceedings of CAV. Lecture Notes in Computer Science, vol. 5643, Springer, 140--156. Google ScholarDigital Library
- R. Bloem, K. Greimel, T. Henzinger, and B. Jobstmann. 2009b. Synthesizing robust systems. In Proceedings of FMCAD. IEEE, 85--92.Google Scholar
- A. Chakrabarti, K. Chatterjee, T. Henzinger, O. Kupferman, and R. Majumdar. 2005. Verifying quantitative properties using bound functions. In Proceedings of CHARME. Lecture Notes in Computer Science, vol. 3725, Springer, 50--64. Google ScholarDigital Library
- A. Chakrabarti, L. de Alfaro, T. Henzinger, and M. Stoelinga. 2003. Resource interfaces. In Proceedings of EMSOFT. Lecture Notes in Computer Science, vol. 2855. Springer, 117--133.Google Scholar
- K. Chatterjee, L. de Alfaro, M. Faella, T. Henzinger, R. Majumdar, and M. Stoelinga. 2006. Compositional quantitative reasoning. In Proceedings of QEST. IEEE, 179--188. Google ScholarDigital Library
- K. Chatterjee and L. Doyen. 2011a. Energy and mean-payoff parity Markov decision processes. In Proceedings of MFCS. 206--218. Google ScholarDigital Library
- K. Chatterjee and L. Doyen. 2011b. Games and Markov decision processes with mean-payoff parity and energy parity objectives. In Proceedings of MEMICS. 37--46. Google ScholarDigital Library
- K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj. 2014. Perfect-information stochastic mean-payoff parity games. In Proceedings of FoSSaCS. 210--225.Google Scholar
- K. Chatterjee, L. Doyen, and T. A. Henzinger. 2010a. Expressiveness and closure properties for quantitative languages. Log. Meth. Comput. Sci. 6, 3.Google ScholarCross Ref
- K. Chatterjee, L. Doyen, and T. A. Henzinger. 2010b. Quantitative languages. ACM Trans. Comput. Log. 11, 4. Google ScholarDigital Library
- K. Chatterjee and M. Henzinger. 2011. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. In Proceedings of SODA. ACM-SIAM, 1318--1336. Google ScholarDigital Library
- K. Chatterjee and M. Henzinger. 2012. An O(n2) algorithm for alternating Büchi games. In Proceedings of SODA. ACM-SIAM, 1386--1399. Google ScholarDigital Library
- K. Chatterjee and M. Henzinger. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. JACM, 61, 3, Article 15. DOI 10.1145/2597631 Google ScholarDigital Library
- K. Chatterjee, M. Henzinger, M. Joglekar, and N. Shah. 2013. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Form. Meth. Syst. Design 42, 3, 301--327. Google ScholarDigital Library
- K. Chatterjee, T. Henzinger, and M. Jurdzinski. 2005. Mean-payoff parity games. In Proceedings of LICS. IEEE, 178--187. Google ScholarDigital Library
- K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh. 2010c. Measuring and synthesizing systems in probabilistic environments. In Proceedings of CAV. Lecture Notes in Computer Science, vol. 6174, Springer, 380--395. Google ScholarDigital Library
- K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh. 2011. Quasy: Quantitative synthesis tool. In Proceedings of TACAS. Lecture Notes in Computer Science, vol. 6605, Springer, 267--271. Google ScholarDigital Library
- K. Chatterjee, M. Jurdziński, and T. Henzinger. 2003. Simple stochastic parity games. In Proceedings of CSL'03. Lecture Notes in Computer Science, vol. 2803, Springer, 100--113.Google ScholarCross Ref
- K. Chatterjee, M. Jurdziński, and T. Henzinger. 2004. Quantitative stochastic parity games. In Proceedings of SODA. ACM-SIAM, 121--130. Google ScholarDigital Library
- K. Chatterjee and J. Lacki. 2013. Faster algorithms for Markov decision processes with low treewidth. In Proceedings of CAV. Lecture Notes in Computer Science, vol. 8044, Springer, 543--558. Google ScholarDigital Library
- C.-H. Cheng, M. Geisinger, H. Ruess, C. Buckl, and A. Knoll. 2012. MGSyn: Automatic synthesis for industrial automation. In Proceedings of CAV. 658--664. Google ScholarDigital Library
- A. Church. 1962. Logic, arithmetic and automata. In Proceedings of the International Mathematical Congress.Google Scholar
- E. M. Clarke and E. A. Emerson. 1981. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Proceedings of the Workshop on Logic of Programs. 52--71. Google ScholarDigital Library
- C. Courcoubetis and M. Yannakakis. 1995. The complexity of probabilistic verification. J. ACM 42, 4, 857--907. Google ScholarDigital Library
- P. Cousot and R. Cousot. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of POPL. ACM, 238--252. Google ScholarDigital Library
- R. Cuninghame-Green. 1979. Minimax Algebra. In Lecture Notes in Economics and Mathematical Systems, vol. 166. Springer-Verlag.Google Scholar
- L. de Alfaro. 1997a. Formal verification of probabilistic systems. Ph.D. thesis, Stanford University.Google Scholar
- L. de Alfaro. 1997b. Temporal logics for the specification of performance and reliability. In Proceedings of STACS'97. Lecture Notes in Computer Science, vol. 1200, Springer, 165--176. Google ScholarDigital Library
- L. de Alfaro. 1998. Stochastic transition systems. In Proceedings of CONCUR. Lecture Notes in Computer Science, vol. 1466, Springer, 423--438. Google ScholarDigital Library
- L. de Alfaro., T. Henzinger, and R. Majumdar. 2003. Discounting the future in systems theory. In Proceedings of ICALP. Lecture Notes in Computer Science, vol. 2719, Springer, 1022--1037. Google ScholarDigital Library
- L. de Alfaro, R. Majumdar, V. Raman, and M. Stoelinga. 2007. Game relations and metrics. In Proceedings of LICS. IEEE, 99--108. Google ScholarDigital Library
- J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. 1999. Metrics for labelled markov systems. In Proceedings of CONCUR. Lecture Notes in Computer Science, vol. 1664, Springer, 258--273. Google ScholarDigital Library
- M. Droste and P. Gastin. 2007. Weighted automata and weighted logics. Theoret. Comput. Sci. 380, 69--86. Google ScholarDigital Library
- M. Droste, W. Kuich, and G. Rahonis. 2008. Multi-valued MSO logics over words and trees. Fund. Inf. 84, 305--327. Google ScholarDigital Library
- M. Droste, W. Kuich, and H. Vogler. 2009. Handbook of Weighted Automata. Springer. Google ScholarDigital Library
- J. Filar and K. Vrieze. 1996. Competitive Markov Decision Processes. Springer. Google ScholarDigital Library
- S. Fortune, J. Hopcroft, and J. Wyllie. 1980. The directed subgraph homeomorphism problem. Theoret. Comput. Sci. 10, 2, 111--121.Google ScholarCross Ref
- S. Gaubert. 1997. Methods and applications of (max, +) linear algebra. In Proceedings of STACS. Lecture Notes in Computer Science, vol. 1200, Springer, 261--282. Google ScholarDigital Library
- GLPK. GLPK (gnu linear programming kit). http://www.gnu.org/software/glpk/.Google Scholar
- B. R. Haverkort. 1998. Performance of Computer Communication Systems: A Model-Based Approach. John Wiley & Sons, Inc., New York, NY, USA. Google ScholarDigital Library
- G. Katz and D. Peled. 2010. Code mutation in verification and automatic code correction. In Proceedings of TACAS. Lecture Notes in Computer Science, vol. 6015, Springer, 435--450. Google ScholarDigital Library
- V. King, O. Kupferman, and M. Y. Vardi. 2001. On the complexity of parity word automata. In Proceedings of FOSSACS. Lecture Notes in Computer Science, vol. 2030, Springer, 276--286. Google ScholarDigital Library
- O. Kupferman and Y. Lustig. 2007. Lattice automata. In Proceedings of VMCAI. Lecture Notes in Computer Science, vol. 4349. Springer, 199--213. Google ScholarDigital Library
- M. Kwiatkowska, G. Norman, and D. Parker. 2009. PRISM: Probabilistic model checking for performance and reliability analysis. ACM SIGMETRICS Perform. Eval. Rev. Google ScholarDigital Library
- P. Niebert, D. Peled, and A. Pnueli. 2008. Discriminative model checking. In Proceedings of CAV. Lecture Notes in Computer Science, vol. 5123, Springer, 504--516. Google ScholarDigital Library
- R. Parr and S. Russell. 1997. Reinforcement learning with hierarchies of machines. In Proceedings of NIPS. MIT Press, 1043--1049. Google ScholarDigital Library
- A. Pnueli. 1977. The temporal logic of programs. In Proceedings of FOCS. IEEE, 46--57. Google ScholarDigital Library
- A. Pnueli and R. Rosner. 1989. On the synthesis of a reactive module. In Proceedings of POPL. ACM, 179--190. Google ScholarDigital Library
- M. Puterman. 1994. Markov Decision Processes. John Wiley & Sons, Inc. New York, NY. Google ScholarDigital Library
- J.-P. Queille and J. Sifakis. 1982. Specification and verification of concurrent systems in CESAR. In Proceedings of Symposium on Programming. Lecture Notes in Computer Science, vol. 137, Springer, 337--351. Google ScholarDigital Library
- P. J. G. Ramadge and W. M. Wonham. 1989. The control of discrete event systems. IEEE Trans. Cont. Theory 77, 81--98.Google Scholar
- S. Safra. 1988. On the complexity of ω-automata. In Proceedings of FOCS. IEEE, 319--327. Google ScholarDigital Library
- M. Vardi and P. Wolper. 1986. An automata-theoretic approach to automatic program verification. In Proceedings of LICS. IEEE, 322--331.Google Scholar
- R. Wimmer, B. Braitling, B. Becker, E. M. Hahn, P. Crouzen, H. Hermanns, A. Dhama, and O. Theel. 2010. Symblicit calculation of long-run averages for concurrent probabilistic systems. In Proceedings of QEST. IEEE, 27--36. Google ScholarDigital Library
Index Terms
- Measuring and Synthesizing Systems in Probabilistic Environments
Recommendations
Measuring and synthesizing systems in probabilistic environments
CAV'10: Proceedings of the 22nd international conference on Computer Aided VerificationOften one has a preference order among the different systems that satisfy a given specification Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each ...
Synthesizing probabilistic composers
FOSSACS'12: Proceedings of the 15th international conference on Foundations of Software Science and Computational StructuresSynthesis from components is the automated construction of a composite system from a library of reusable components such that the system satisfies the given specification. This is in contrast to classical synthesis, where systems are always "constructed ...
Synthesizing complementary circuits automatically
One of the most difficult jobs in designing communication and multimedia chips is to design and verify the complex complementary circuit pair (E, E-1), in which circuit E transforms information into a format suitable for transmission and storage, and ...
Comments