Skip to main content
Log in

Model checking real-time value-passing systems

  • Artificial Intelligence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper, to model check real-time value-passing systems, a formal languageTimed Symbolic Transition Graph and a logic system namedTimed Predicate μ-Calculus are proposed. An algorithm is presented which is local in that it generates and investigates the reachable state space in top-down fashion and maintains the partition for time evaluations as coarse as possible whileon-the-fly instantiating data variables. It can deal with not only data variables with finite value domain, but also the so calleddata independent variables with infinite value domain. To authors knowledge, this is the first algorithm for model checking timed systems containing value-passing features.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alur R, Courcoubetis C, Dill D. Model-checking in dense real-time.Information and Computation, May 1993, 104(1): 2–34.

    Article  MATH  MathSciNet  Google Scholar 

  2. Alur R, Dill D. A theory of timed automata.Theoretical Computer Science, 1994, 126(2): 183–236.

    Article  MATH  MathSciNet  Google Scholar 

  3. Henzinger T A, Kupferman O, Vardi M Y. A space-efficient on-the-fly algorithm for real-time model checking. InCONCUR'96, LNCS 1119, Springer-Verlag, 1996, pp.514–529.

  4. Henzinger T A, Nicollin X, Sifakis J, Yovine S. Symbolic model checking for real-time systems.Information and Computation, 1994, 111: 193–244.

    Article  MATH  MathSciNet  Google Scholar 

  5. Sokolsky O V, Smolka S A. Local model checking for real-time systems. InComputer Aided Verification, Proc. 7th Int. Workshop, LNCS 939, Liege, July 1995, pp.211–224.

  6. Milner R. Communication and Concurrency. Prentice Hall, 1989.

  7. Hennessy M, Liu X. A modal logic for message passing processes.Acta Informatica, 1995, 32: 375–393.

    MATH  MathSciNet  Google Scholar 

  8. Rathke J, Hennessy M. Local model checking for value-passing processes. InProc. the 9th International Conference on Theoretical Aspects of Computer Software, 1997, pp.250–266.

  9. Clarke E M, Grumberg O, Peled D A. Model Checking. The MIT Press. 1999.

  10. Keller R M. Formal verification of parallel programs.Communications of ACM, 1976, 19(7): 371–384.

    Article  MATH  Google Scholar 

  11. Manna Z, Pnueli A. The temporal logic of reactive and concurrent systems: Specification. Springer-Verlag, New York, 1992.

    Google Scholar 

  12. Clarke E M, Emerson E A. Design and synthesis of synchronization skeletons using branching time temporal logic. InProc. Workshop on Logic of Programs, LNCS 131, Springer-Verlag, 1981, pp.52–71.

  13. Ben-Ari M, Manna Z, Pnueli A. The temporal logic of branching time.Acta Informatica, 1983, 20: 207–226.

    Article  MATH  MathSciNet  Google Scholar 

  14. Kozen D. Results on the propositional mu-calculus.Theoretical Computer Science, 1983, 27: 333–354.

    Article  MATH  MathSciNet  Google Scholar 

  15. Lin H. “On-the-fly instantiation” of value-passing processes. InFORTE/PSTV'98, Kluwer Academic Publishers, 1998, pp.215–230.

  16. Chen J, Lin H. Timed symbolic transition graph and timed bisimulation.Chinese Journal of Computers, 2002, 25(2): 113–121. (in Chinese)

    MathSciNet  Google Scholar 

  17. Lin H. Symbolic transition graph with assignment. InCONCUR'96, LNCS 1119, Springer-Verlag, 1996, pp.50–65.

  18. Holmer U, Larsen K G, Wang Y. Deciding properties of regular real timed processes. InProc. CAV'91, LNCS 575, 1991, pp.443–453.

  19. Cleaveland R, Steffen B. A linear-time model checking algorithm for the alternation-free modal mu-calculus.Formal Methods in System Design, 1993, 2: 121–147.

    Article  MATH  Google Scholar 

  20. Andersen H R. Model checking and Boolean graph.Theoretical Computer Science, 1994, 126(1): 3–30.

    Article  MATH  MathSciNet  Google Scholar 

  21. Bengtsson J, Larsen K G, Larsson Fet al. UPPAAL—A tool suite for the automatic verification of real-time systems. Hybrid Systems III,LNCS 1066, Springer-Verlag, 1996, pp.232–243.

  22. Tripakis S, Courcoubetis C. Extending PROMELA and SPIN for real time. InProc. TACAS'96, Margaria T, Steffen B (eds.),LNCS 1055, Springer-Verlag, 1996, pp.329–348.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jing Chen.

Additional information

This work is supported by the National Natural Science Foundation of China under Grant No. 60203028.

Jing Chen is a Ph.D. candidate in Institute of Software, the Chinese Academy of Sciences. His research interests include automatic verification of concurrent value-passing and real-time systems.

Zi-Ning Cao received the Ph.D. degree in computer science from Tsinghua University in 2001. Now he is a postdoctoral fellow in Institute of Software, the Chinese Academy of Sciences. His main research interests include logic in computer science and concurrency theory.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, J., Cao, ZN. Model checking real-time value-passing systems. J. Compt. Sci. & Technol. 19, 459–471 (2004). https://doi.org/10.1007/BF02944747

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02944747

Keywords

Navigation