Skip to main content
Springer Nature Link
Log in

Symbolic Verification of Distributed Real-Time Systems with Complex Synchronizations

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

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

Included in the following conference series:

Abstract

CSP-style synchronizations have been used extensively in the construction of mathematical models for the verification of embedded systems. Although they allow for the modeling of complex cooperation among many processes in a natural environment, not many tools have been developed to support the modeling capability in this regard. In this paper, we first give examples to argue that special algorithms are needed for the efficient verification of systems with complex synchronizations. We then define our models of distributed real-time systems with synchronized cooperation among many processes. We present algorithms for the construction of BDD-like data-structures for the characterization of complex synchronizations among many processes. We present weakest precondition algorithms that take advantage of the just-mentioned BDD-like data-structures for the efficient verification of complex real-time systems. Finally, we report experiments and argue that the techniques could be useful in practice.

The work is partially supported by NSC, Taiwan, ROC under grants NSC 92-2213-E-002-103, NSC 92-2213-E-002-104, and by the System Verification Technology Project of Industrial Technology Research Institute, Taiwan, ROC (2004).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alur, R., Courcoubetis, C., Dill, D.L.: Model Checking for Real-Time Systems. IEEE LICS (1990)

    Google Scholar 

  2. Alur, R., Dill, D.L.: Automata for modelling real-time systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 322–335. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  3. Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic Model Checking: 1020 States and Beyond. IEEE LICS (1990)

    Google Scholar 

  4. Bengtsson, J., Larsen, K., Larsson, F., Pettersson, P., Yi, W.: UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems. In: Hybrid Control System Symposium. LNCS. Springer, Heidelberg (1996)

    Google Scholar 

  5. Bryant, R.E.: Graph-based Algorithms for Boolean Function Manipulation. IEEE Trans. Comput. C-35(8) (1986)

    Google Scholar 

  6. Dill, D.L.: Timing Assumptions and Verification of Finite-state Concurrent Systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407. Springer, Heidelberg (1990)

    Google Scholar 

  7. Fourier, J.B. (reported in:) Analyse des travaux de l’Académie Royale des Sciences pendant l’année 1824, Partie Mathématique, 1827

    Google Scholar 

  8. Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic Model Checking for Real-Time Systems. IEEE LICS (1992)

    Google Scholar 

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

    MATH  Google Scholar 

  10. Shaw, A.: Communicating Real-Time State Machines. IEEE Transactions on Software Engineering 18(9) (September 1992)

    Google Scholar 

  11. Wang, F.: Efficient Data-Structure for Fully Symbolic Verification of Real-Time Software Systems. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol. 1785, p. 157. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Wang, F.: Efficient Verification of Timed Automata with BDD-like Data-Structures, STTT (Software Tools for Technology Transfer). In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol. 2575, pp. 189–205. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Wang, F.: Model-Checking Distributed Real-Time Systems with States, Events, and Multiple Fairness Assumptions. In: Rattray, C., Maharaj, S., Shankland, C. (eds.) AMAST 2004. LNCS, vol. 3116, pp. 553–567. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Wang, F., Hsiung, P.-A.: Efficient and User-Friendly Verification. IEEE Transactions on Computers (January 2002)

    Google Scholar 

  15. Wang, F., Huang, G.-D., Yu, F.: Symbolic Simulation of Real-Time Concurrent Systems. In: Chen, J., Hong, S. (eds.) RTCSA 2003. LNCS, vol. 2968, pp. 595–617. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  16. Yovine, S.: Kronos: A Verification Tool for Real-Time Systems. International Journal of Software Tools for Technology Transfer 1(1/2) (October 1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical Engineering, National Taiwan University, 1, Sec. 4, Roosevelt Rd., Taipei, 106, Taiwan, ROC

    Farn Wang

Authors
  1. Farn Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, The University of Manchester, M13 9PL, Manchester, United Kingdom

    Kung-Kiu Lau

  2. School of Computer Science, University of Manchester, M13 9PL, Manchester, UK

    Richard Banach

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, F. (2005). Symbolic Verification of Distributed Real-Time Systems with Complex Synchronizations. In: Lau, KK., Banach, R. (eds) Formal Methods and Software Engineering. ICFEM 2005. Lecture Notes in Computer Science, vol 3785. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576280_21

Download citation

  • DOI: https://doi.org/10.1007/11576280_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29797-0

  • Online ISBN: 978-3-540-32250-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics