Skip to main content
SpringerLink
Log in

PRTS: An Approach for Model Checking Probabilistic Real-Time Hierarchical Systems

  • Conference paper
Formal Methods and Software Engineering (ICFEM 2011)

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

Included in the following conference series:

Abstract

Model Checking real-life systems is always difficult since such systems usually have quantitative timing factors and work in unreliable environment. The combination of real-time and probability in hierarchical systems presents a unique challenge to system modeling and analysis. In this work, we develop an automated approach for verifying probabilistic, real-time, hierarchical systems. Firstly, a modeling language called PRTS is defined, which combines data structures, real-time and probability. Next, a zone-based method is used to build a finite-state abstraction of PRTS models so that probabilistic model checking could be used to calculate the probability of a system satisfying certain property. We implemented our approach in the PAT model checker and conducted experiments with real-life case studies.

This research was partially supported by research grant “SRG ISTD 2010 001” from Singapore University of Technology and Design.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking for Probabilistic Real-time Systems. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 115–126. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  2. Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science 126, 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baier, C., Clarke, E.M., Garmhausen, V.H., Kwiatkowska, M.Z., Rya, M.: Symbolic Model Checking for Probabilistic Processes. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 430–440. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  4. Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.: Model-Checking Algorithms for Continuous-Time Markov Chains. IEEE Trans. Software Eng. 29(6), 524–541 (2003)

    Article  MATH  Google Scholar 

  5. Baier, C., Katoen, J.: Principles of Model Checking. The MIT Press, Cambridge (2008)

    MATH  Google Scholar 

  6. Beauquier, D.: On Probabilistic Timed Automata. Theor. Comput. Sci. 292(1), 65–84 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Behrmann, G., David, A., Larsen, K.G., Håkansson, J., Pettersson, P., Yi, W., Hendriks, M.: UPPAAL 4.0. In: QEST, pp. 125–126. IEEE, Los Alamitos (2006)

    Google Scholar 

  8. Behrmann, G., Larsen, K.G., Pearson, J., Weise, C., Yi, W.: Efficient timed reachability analysis using clock difference diagrams. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 341–353. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Bengtsson, J., Yi., W.: Timed Automata: Semantics, Algorithms and Tools. In: Lectures on Concurrency and Petri Nets, pp. 87–124 (2003)

    Google Scholar 

  10. Butterfield, A., Sherif, A., Woodcock, J.: Slotted-circus. In: Davies, J., Gibbons, J. (eds.) IFM 2007. LNCS, vol. 4591, pp. 75–97. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Daws, C., Kwiatkowska, M., Norman, G.: Automatic Verification of the IEEE 1394 Root Contention Protocol with KRONOS and PRISM. International Journal on Software Tools for Technology Transfer 5(2-3), 221–236 (2004)

    Article  Google Scholar 

  12. Dill, D.L.: Timing Assumptions and Verification of Finite-State Concurrent Systems. In: Automatic Verification Methods for Finite State Systems, pp. 197–212 (1989)

    Google Scholar 

  13. Garmhausen, V.H., Aguiar Campos, S.V., Clarke, E.M.: ProbVerus: Probabilistic Symbolic Model Checking. In: ARTS, pp. 96–110 (1999)

    Google Scholar 

  14. Gregersen, H., Jensen, H.E.: Formal Design of Reliable Real Time Systems. PhD thesis (1995)

    Google Scholar 

  15. Hinton, A., Kwiatkowska, M.Z., Norman, G., Parker, D.: PRISM: A Tool for Automatic Verification of Probabilistic Systems. In: Hermanns, H. (ed.) TACAS 2006. LNCS, vol. 3920, pp. 441–444. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  17. Holzmann, G.J.: The Model Checker SPIN. IEEE Trans. on Software Engineering 23(5), 279–295 (1997)

    Article  Google Scholar 

  18. Kwiatkowska, M., Norman, G., Parker, D.: A Framework for Verification of Software with Time and Probabilities. In: Chatterjee, K., Henzinger, T.A. (eds.) FORMATS 2010. LNCS, vol. 6246, pp. 25–45. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  19. 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 

  20. Kwiatkowska, M., Norman, G., Parker, D., Sproston, J.: Performance Analysis of Probabilistic Timed Automata using Digital Clocks. In: FMSD, vol. 29, pp. 33–78 (2006)

    Google Scholar 

  21. Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Automatic Verification of Real-time Systems with Discrete Probability Distributions. Theoretical Computer Science 282(1), 101–150 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  22. Kwiatkowska, M., Norman, G., Sproston, J., Wang, F.: Symbolic Model Checking for Probabilistic Timed Automata. Information and Computation 205(7), 1027–1077 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  23. Mahony, B.P., Dong, J.S.: Blending Object-Z and Timed CSP: An Introduction to TCOZ. In: ICSE, pp. 95–104 (1998)

    Google Scholar 

  24. Ouaknine, J., Worrell, J.: Timed CSP = Closed Timed Safety Automata. Electrical Notes Theoretical Computer Science 68(2) (2002)

    Google Scholar 

  25. Schneider, S.: Concurrent and Real-time Systems. John Wiley and Sons, Chichester (2000)

    Google Scholar 

  26. Sun, J., Liu, Y., Dong, J.S., Pang, J.: PAT: Towards Flexible Verification under Fairness. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 709–714. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  27. Sun, J., Liu, Y., Dong, J.S., Zhang, X.: Verifying Stateful Timed CSP Using Implicit Clocks and Zone Abstraction. In: Breitman, K., Cavalcanti, A. (eds.) ICFEM 2009. LNCS, vol. 5885, pp. 581–600. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  28. Sun, J., Song, S.Z., Liu, Y.: Model Checking Hierarchical Probabilistic Systems. In: Dong, J.S., Zhu, H. (eds.) ICFEM 2010. LNCS, vol. 6447, pp. 388–403. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  29. Sun, J., Song, S.Z., Liu, Y., Dong, J.S.: PRTS: Specification and Model Checking. Technical report (2010), http://www.comp.nus.edu.sg/pat/preport.pdf

Download references

Author information

Authors and Affiliations

  1. Singapore University of Technology and Design, Singapore

    Jun Sun

  2. National University of Singapore, Singapore

    Yang Liu & Jin Song Dong

  3. NUS Graduate School for Integrative Sciences and Engineering, Singapore

    Songzheng Song

  4. School of Computer Science and Technology, Tianjin University, China

    Xiaohong Li

Authors
  1. Jun Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Songzheng Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jin Song Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Xiaohong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing, Teesside University, UK

    Shengchao Qin

  2. LMAM and Department of Informatics, School of Mathematical Sciences,, Peking University, China

    Zongyan Qiu

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sun, J., Liu, Y., Song, S., Dong, J.S., Li, X. (2011). PRTS: An Approach for Model Checking Probabilistic Real-Time Hierarchical Systems. In: Qin, S., Qiu, Z. (eds) Formal Methods and Software Engineering. ICFEM 2011. Lecture Notes in Computer Science, vol 6991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24559-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24559-6_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24558-9

  • Online ISBN: 978-3-642-24559-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation