Skip to main content
SpringerLink
Log in

Repairing Errors in PRISM Programs Using Probabilistic Abduction Reasoning

  • Conference paper
  • First Online:
Model and Data Engineering

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9344))

  • 812 Accesses

Abstract

This paper presents a technique to diagnose probabilistic counterexamples that are generated when model checking probabilistic systems against probabilistic properties. In probabilistic model checking (PMC), a counterexample is a set of paths in which a path formula holds, and their cumulative probability mass violates the probability bound. The diagnosis is to repair errors in probabilistic PRISM programs using the probabilistic abduction reasoning on Independent Choice Logic (ICL) programs describing the generated probabilistic counterexamples.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aljazzar, H., Leitner-Fischer, F., Leue, S., Simeonov, D.: DiPro - a tool for probabilistic counterexample generation. In: Groce, A., Musuvathi, M. (eds.) SPIN Workshops 2011. LNCS, vol. 6823, pp. 183–187. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  2. Aljazzar, H., Leue, S.: Directed explicit state-space search in the generation of counterexamples for stochastic model checking. IEEE Trans. Softw. Eng. 36(1), 37–60 (2010)

    Article  Google Scholar 

  3. Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.: Model-checking algorithms for continuous-time markov chains. IEEE Trans. Softw. Eng. 29(6), 524–541 (2003)

    Article  Google Scholar 

  4. Bartocci, E., Grosu, R., Katsaros, P., Ramakrishnan, C.R., Smolka, S.A.: Model repair for probabilistic systems. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 326–340. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Beer, I., Ben-David, S., Chockler, H., Orni, A., Trefler, R.J.: Explaining counterexamples using causality. Formal Methods Syst. Des. 40(1), 20–40 (2012)

    Article  MATH  Google Scholar 

  6. Debbi, H., Bourahla, M.: Causal analysis of probabilistic counterexamples. In: 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMCODE 2013, 18–20 October 2013, Portland, OR, USA, pp. 77–86 (2013)

    Google Scholar 

  7. Han, T., Katoen, J., Damman, B.: Counterexample generation in probabilistic model checking. IEEE Trans. Software Eng. 35(2), 241–257 (2009)

    Article  Google Scholar 

  8. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Asp. Comput. 6(5), 512–535 (1994)

    Article  MATH  Google Scholar 

  9. Jansen, N., Wimmer, R., Ábrahám, E., Zajzon, B., Katoen, J., Becker, B., Schuster, J.: Symbolic counterexample generation for large discrete-time markov chains. Sci. Comput. Program. 91, 90–114 (2014)

    Article  Google Scholar 

  10. Kuntz, M., Leitner-Fischer, F., Leue, S.: From probabilistic counterexamples via causality to fault trees. In: Flammini, F., Bologna, S., Vittorini, V. (eds.) SAFECOMP 2011. LNCS, vol. 6894, pp. 71–84. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  11. Kwiatkowska, M., Norman, G., Parker, D.: Stochastic model checking. In: Bernardo, M., Hillston, J. (eds.) SFM 2007. LNCS, vol. 4486, pp. 220–270. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585–591. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  13. Leitner-Fischer, F., Leue, S.: Causality checking for complex system models. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) VMCAI 2013. LNCS, vol. 7737, pp. 248–267. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  14. Poole, D.: Logic programming, abduction and probability - A top-down anytime algorithm for estimating prior and posterior probabilities. New Gener. Comput. 11(3), 377–400 (1993)

    Article  MATH  Google Scholar 

  15. Poole, D.: The independent choice logic and beyond. In: De Raedt, L., Frasconi, P., Kersting, K., Muggleton, S.H. (eds.) Probabilistic Inductive Logic Programming. LNCS (LNAI), vol. 4911, pp. 222–243. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Pure and Applied Mathematics (LMPA), Computer Science Department, University of M’sila, BP 166 Ichebilia, 28000, M’sila, Algeria

    Mustapha Bourahla

Authors
  1. Mustapha Bourahla
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mustapha Bourahla .

Editor information

Editors and Affiliations

  1. National Engineering School for Mechanics and Aerotechnics, Poitiers, France

    Ladjel Bellatreche

  2. University of Thessaloniki, Thessaloniki, Greece

    Yannis Manolopoulos

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Bourahla, M. (2015). Repairing Errors in PRISM Programs Using Probabilistic Abduction Reasoning. In: Bellatreche, L., Manolopoulos, Y. (eds) Model and Data Engineering. Lecture Notes in Computer Science(), vol 9344. Springer, Cham. https://doi.org/10.1007/978-3-319-23781-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23781-7_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23780-0

  • Online ISBN: 978-3-319-23781-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation