Skip to main content

2017 | OriginalPaper | Buchkapitel

Improving Probability Estimation Through Active Probabilistic Model Learning

verfasst von : Jingyi Wang, Xiaohong Chen, Jun Sun, Shengchao Qin

Erschienen in: Formal Methods and Software Engineering

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

It is often necessary to estimate the probability of certain events occurring in a system. For instance, knowing the probability of events triggering a shutdown sequence allows us to estimate the availability of the system. One approach is to run the system multiple times and then construct a probabilistic model to estimate the probability. When the probability of the event to be estimated is low, many system runs are necessary in order to generate an accurate estimation. For complex cyber-physical systems, each system run is costly and time-consuming, and thus it is important to reduce the number of system runs while providing accurate estimation. In this work, we assume that the user can actively tune the initial configuration of the system before the system runs and answer the following research question: how should the user set the initial configuration so that a better estimation can be learned with fewer system runs. The proposed approach has been implemented and evaluated with a set of benchmark models, random generated models, and a real-world water treatment system.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
2
We use P to denote transition matrices and \(\mathscr {P}\) to denote the probability measure defined by P.
 
Literatur
2.
Zurück zum Zitat Linear programming – Wikipedia, the free encyclopedia (2016). Accessed 24 Nov 2016 Linear programming – Wikipedia, the free encyclopedia (2016). Accessed 24 Nov 2016
3.
Zurück zum Zitat Mean squared error – Wikipedia, the free encyclopedia (2016). Accessed 7 Dec 2016 Mean squared error – Wikipedia, the free encyclopedia (2016). Accessed 7 Dec 2016
5.
Zurück zum Zitat Baier, C., Katoen, J.-P., et al.: Principles of Model Checking, vol. 26202649. MIT Press, Cambridge (2008)MATH Baier, C., Katoen, J.-P., et al.: Principles of Model Checking, vol. 26202649. MIT Press, Cambridge (2008)MATH
6.
Zurück zum Zitat Barsotti, F., De Castro, Y., Espinasse, T., Rochet, P.: Estimating the transition matrix of a markov chain observed at random times. Stat. Probab. Lett. 94, 98–105 (2014)MathSciNetCrossRefMATH Barsotti, F., De Castro, Y., Espinasse, T., Rochet, P.: Estimating the transition matrix of a markov chain observed at random times. Stat. Probab. Lett. 94, 98–105 (2014)MathSciNetCrossRefMATH
7.
Zurück zum Zitat Brinker, K.: Incorporating diversity in active learning with support vector machines. In: Machine Learning, Proceedings of the Twentieth International Conference (ICML 2003), 21–24 August 2003, Washington, DC, USA, pp. 59–66 (2003) Brinker, K.: Incorporating diversity in active learning with support vector machines. In: Machine Learning, Proceedings of the Twentieth International Conference (ICML 2003), 21–24 August 2003, Washington, DC, USA, pp. 59–66 (2003)
8.
Zurück zum Zitat Chen, Y., Nielsen, T.D.: Active learning of markov decision processes for system verification. In: 2012 11th International Conference on Machine Learning and Applications (ICMLA), vol. 2, pp. 289–294. IEEE (2012) Chen, Y., Nielsen, T.D.: Active learning of markov decision processes for system verification. In: 2012 11th International Conference on Machine Learning and Applications (ICMLA), vol. 2, pp. 289–294. IEEE (2012)
9.
Zurück zum Zitat Cochran, G.: Laplace’s ratio estimator. In: David, H.A. (ed.) Contributions to Survey Sampling and Applied Statistics, pp. 3–10. Academic Press, New York (1978)CrossRef Cochran, G.: Laplace’s ratio estimator. In: David, H.A. (ed.) Contributions to Survey Sampling and Applied Statistics, pp. 3–10. Academic Press, New York (1978)CrossRef
10.
Zurück zum Zitat Gale, W.A., Sampson, G.: Good-turing frequency estimation without tears*. J. Quant. Linguist. 2(3), 217–237 (1995)CrossRef Gale, W.A., Sampson, G.: Good-turing frequency estimation without tears*. J. Quant. Linguist. 2(3), 217–237 (1995)CrossRef
11.
Zurück zum Zitat Gurobi Optimization Incorporation: Gurobi optimizer reference manual (2016) Gurobi Optimization Incorporation: Gurobi optimizer reference manual (2016)
12.
Zurück zum Zitat Heidelberger, P.: Fast simulation of rare events in queueing and reliability models. ACM Trans. Model. Comput. Simul. (TOMACS) 5(1), 43–85 (1995)CrossRefMATH Heidelberger, P.: Fast simulation of rare events in queueing and reliability models. ACM Trans. Model. Comput. Simul. (TOMACS) 5(1), 43–85 (1995)CrossRefMATH
13.
Zurück zum Zitat Lesser, K., Oishi, M.: Reachability for partially observable discrete time stochastic hybrid systems. Automatica 50(8), 1989–1998 (2014)MathSciNetCrossRefMATH Lesser, K., Oishi, M.: Reachability for partially observable discrete time stochastic hybrid systems. Automatica 50(8), 1989–1998 (2014)MathSciNetCrossRefMATH
14.
Zurück zum Zitat Mao, H., Chen, Y., Jaeger, M., Nielsen, T.D., Larsen, K.G., Nielsen, B.: Learning probabilistic automata for model checking. In: Eighth International Conference on Quantitative Evaluation of Systems (QEST), pp. 111–120. IEEE (2011) Mao, H., Chen, Y., Jaeger, M., Nielsen, T.D., Larsen, K.G., Nielsen, B.: Learning probabilistic automata for model checking. In: Eighth International Conference on Quantitative Evaluation of Systems (QEST), pp. 111–120. IEEE (2011)
15.
Zurück zum Zitat McAllester, D.A., Schapire, R.E.: On the convergence rate of good-turing estimators. In: COLT, pp. 1–6 (2000) McAllester, D.A., Schapire, R.E.: On the convergence rate of good-turing estimators. In: COLT, pp. 1–6 (2000)
16.
Zurück zum Zitat Moon, T.K.: The expectation-maximization algorithm. IEEE Sig. Proces. Mag. 13(6), 47–60 (1996)CrossRef Moon, T.K.: The expectation-maximization algorithm. IEEE Sig. Proces. Mag. 13(6), 47–60 (1996)CrossRef
17.
Zurück zum Zitat Tabakov, D., Vardi, M.Y.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 396–411. Springer, Heidelberg (2005). doi:10.1007/11591191_28 CrossRef Tabakov, D., Vardi, M.Y.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 396–411. Springer, Heidelberg (2005). doi:10.​1007/​11591191_​28 CrossRef
18.
Zurück zum Zitat Wang, J., Sun, J., Qin, S.: Verifying complex systems probabilistically through learning, abstraction and refinement. arXiv preprint arXiv:1610.06371 (2016) Wang, J., Sun, J., Qin, S.: Verifying complex systems probabilistically through learning, abstraction and refinement. arXiv preprint arXiv:​1610.​06371 (2016)
19.
Zurück zum Zitat Wang, J., Sun, J., Yuan, Q., Pang, J.: Should we learn probabilistic models for model checking? a new approach and an empirical study. In: Huisman, M., Rubin, J. (eds.) FASE 2017. LNCS, vol. 10202, pp. 3–21. Springer, Heidelberg (2017). doi:10.1007/978-3-662-54494-5_1 CrossRef Wang, J., Sun, J., Yuan, Q., Pang, J.: Should we learn probabilistic models for model checking? a new approach and an empirical study. In: Huisman, M., Rubin, J. (eds.) FASE 2017. LNCS, vol. 10202, pp. 3–21. Springer, Heidelberg (2017). doi:10.​1007/​978-3-662-54494-5_​1 CrossRef
20.
Zurück zum Zitat Whittaker, J.A., Thomason, M.G.: A markov chain model for statistical software testing. IEEE Trans. Softw. Eng. 20(10), 812–824 (1994)CrossRef Whittaker, J.A., Thomason, M.G.: A markov chain model for statistical software testing. IEEE Trans. Softw. Eng. 20(10), 812–824 (1994)CrossRef
Metadaten
Titel
Improving Probability Estimation Through Active Probabilistic Model Learning
verfasst von
Jingyi Wang
Xiaohong Chen
Jun Sun
Shengchao Qin
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-68690-5_23