Skip to main content

A Decomposition Method for the Verification of a Real-Time Safety-Critical Protocol

  • Conference paper
  • First Online:
  • 571 Accesses

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

Abstract

Formal methods, especially model checking techniques, are often used for the verification of the resilience of safety critical systems. The usual complexity of the verification problem in real life systems (due to state space explosion and the handling of time dependent behavior) demands efficient techniques. In this paper we propose a decomposition approach: the layered structure of the system is exploited to decompose the verification problem to smaller and tractable ones. In addition, the structure of the requirements (formalized as the combination of reachability and liveness properties) is also exploited to construct simpler verification problems for the model checker. The decomposition approach is demonstrated in case of the verification of a distributed protocol in a SCADA system that shall provide functionality even after the occurrence of a finite number of transient faults.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   44.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

Learn about institutional subscriptions

References

  1. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)

    Article  MathSciNet  Google Scholar 

  2. Bartha, T., Vörös, A., Jámbor, A., Darvas, D.: Verification of an industrial safety function using coloured petri nets and model checking. In: Proceedings of the 14th International Conference on Modern Information Technology in the Innovation Processes of the Industrial Entreprises (MITIP 2012), pp. 472–485. Hungarian Academy of Sciences, Computer and Automation Research Institute (MTA SZTAKI) (2012)

    Google Scholar 

  3. Behrmann, G., David, A., Larsen, K., Hakansson, J., Petterson, P., Yi, W., Hendriks, M.: Uppaal 4.0. In: Third International Conference on Quantitative Evaluation of Systems (QEST 2006), pp. 125–126 (2006)

    Google Scholar 

  4. Bengtsson, J.E., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 87–124. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)

    Google Scholar 

  6. D‘Argenio, P., Katoen, J.P., Ruys, T., Tretmans, J.: The bounded retransmission protocol must be on time!. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217. Springer, Heidelberg (1997)

    Google Scholar 

  7. Gerke, M., Ehlers, R., Finkbeiner, B., Peter, H.-J.: Model checking the FlexRay physical layer protocol. In: Kowalewski, S., Roveri, M. (eds.) FMICS 2010. LNCS, vol. 6371, pp. 132–147. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Kaivola, R., Ghughal, R., Narasimhan, N., Telfer, A., Whittemore, J., Pandav, S., Slobodová, A., Taylor, C., Frolov, V., Reeber, E., Naik, A.: Replacing testing with formal verification in Intel CoreTM i7 processor execution engine validation. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 414–429. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Pike, L.: Modeling time-triggered protocols and verifying their real-time schedules. In: Formal Methods in Computer Aided Design (FMCAD 2007), pp. 231–238 (2007)

    Google Scholar 

  10. Ravn, A.P., Srba, J., Vighio, S.: Modelling and verification of web services business activity protocol. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 357–371. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  11. Tóth, T., Vörös, A., István, M.: K-induction based verification of real-time safety critical systems. New Results in Dependability and Computer Systems. AISC, vol. 224, pp. 469–478. Springer International Publishing, Switzerland (2013)

    Chapter  Google Scholar 

Download references

Acknowledgments

This work was partially supported by Gedeon Richter Plc. It was also supported by the ARTEMIS JU and the Hungarian Research and Technological Innovation Fund in the frame of the R5-COP project.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to András Vörös .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Tóth, T., Vörös, A., Majzik, I. (2015). A Decomposition Method for the Verification of a Real-Time Safety-Critical Protocol. In: Fantechi, A., Pelliccione, P. (eds) Software Engineering for Resilient Systems. SERENE 2015. Lecture Notes in Computer Science(), vol 9274. Springer, Cham. https://doi.org/10.1007/978-3-319-23129-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23129-7_3

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics