Skip to main content
SpringerLink
Log in

Model-checking fair dense-time systems with propositions and events

  • Regular Paper
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

We propose a temporal logic, \(\hbox {TECTL}^{F}\), for the flexible specification of distributed real-time systems with constraints involving events, propositions, and fairness. We then present algorithms for model-checking \(\hbox {TECTL}^{F}\)formulas and a speed-up technique for refuting certain formulas. Finally, we report the implementation and experiment of the ideas in our tool, \(\mathbf{RED}\) 8.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Notes

  1. Note that we allow labeling a set of events on transitions. The reason is that in our tool, we may use such labels to construct global transitions of multiple parties which can be useful in modeling broadcasting transitions. For more details, check [36].

  2. This is a zone-predicate for precondition to strong fairness assumption \(\psi _1\delta \psi _2\) that does not violate the event weak fairness assumptions in \(\Psi \).

References

  1. Aceto, L., Burgueno, A., Larsen, K.G.: Model checking via reachability testing for timed automata. In: Steffen, B. (ed.), 4th TACAS, volume LNCS 1384, pp. 263–280 (1998)

  2. Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking in dense real-time. Inf. Comput. 104(1), 2–34 (1993)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J. ACM 43(1), 116–146 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Alur, R., Henzinger, T.A.: A really temporal logic. In: 30th IEEE FOCS, pp. 164–169 (1989)

  6. Alur, R., Henzinger, T.A.: Logics and models of real time: a survey. In: Real Time: Theory in Practice, volume LNCS 600, pp. 74–106. Springer, Berlin (1992)

  7. Alur, R., Henzinger, T.A.: Real-time logics: complexity and expressiveness. Inf. Comput. 104, 35–77 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  8. Barbuti, R., Tesei, L.: Timed automata with urgent transitions. Acta Inf 40(5), 317–347 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput., C-35(8) (1986)

  10. Burch, J., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.: Symbolic model checking: \(10^{20}\) states and beyond. In: IEEE LICS (1990)

  11. Chaki, S., Clarke, E.M., Ouaknine, J., Sharygina, N., Sinha, N.: State/event-based software model checking. In: IFM, volume LNCS 2999. Springer, Berlin (2004)

  12. Chandy, K.M., Misra, J.: Parallel Program Design-A Foundation. Addison-Wesley, Reading (1988)

    MATH  Google Scholar 

  13. Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Workshop on Logic of Programs, volume LNCS 131. Springer, Berlin (1981)

  14. Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Conference on Computer Aided Verification (CAV), volume LNCS 407. Springer, Berlin (1989)

  15. Emerson, E.A., Halpern, J.Y.: Decision procedures and expressiveness in the temporal logic of branching time. J. Comput. Syst. Sci. 30(1), 1–24 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  16. Emerson, E.A., Halpern, J.Y.: ‘sometimes’ and ‘not never’ revisited: on branching versus linear time temporal logic. J. ACM 33(1), 151–178 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  17. Emerson, E.A., Lei, C.-L.: Modalities for model checking: branching time logic strikes back. Sci. Comput. Program. 8, 275–306 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  18. Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Information and Computation, 111, 193–244 (a preliminary version appeared in the Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, pp. 394–406 (1992)) (1994)

  19. Huth, M., Jagadeesan, R., Schmidt, D.: Modal transition systems: a foundation for three-valued program analysis. In: ESOP, volume LNCS 2028. Springer, Berlin (2001)

  20. Jensen, H.E., Larsen, K.G., Skou, A.: Modelling and analysis of a collision avoidance protocol using spin and uppaal. In: 2nd SPIN, Workshop (1996)

  21. Kindler, E., Vesper, T.: Estl: A temporal logic for events and states. In: ATPN, volume LNCS 1420. Springer, Berlin (1998)

  22. Kozen, D.: Results on the propositional mu-calculus. Theor. Comput. Sci. 27, 333–354 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  23. Nicola, R.D., Vaandrager, F.: Three logics for branching bisimulation. J. ACM 42(2), 458–487 (1995)

    Article  MATH  Google Scholar 

  24. Pnueli, A.: The temporal logic of programs. In: 18th Annual IEEE-CS Symposium on Foundations of Computer, Science, pp. 45–57 (1977)

  25. Shaw, A.: Communicating real-time state machines. IEEE Trans. Softw. Eng., 18(9) (1992)

  26. Silberschatz, A., Gagne, G., Galvin, P.B.: Operating System Principles, 7th edn. Wiley, London (2004)

    Google Scholar 

  27. Wang, F.: Efficient data-structure for fully symbolic verification of real-time software systems. In: TACAS, volume LNCS 1785. Springer, Berlin (2000)

  28. Wang, F.: Efficient verification of timed automata with BDD-like data-structures. In. J. Softw. Tools Technol. Transf., 6(1) (special issue for the 4th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), Jan. 2003, LNCS 2575, Springer, Berlin) (2004)

  29. Wang, F.: Efficient model-checking of dense-time systems with time-convexity analysis. In: IEEE Real-Time System Symposium (RTSS). IEEE Computer Society (2008)

  30. Wang, F.: Time-progress evaluation for dense-time automata with concave path conditions. In: Automated Technology for Verification and Analysis (ATVA), volume LNCS 5311. Springer, Berlin (2008)

  31. Wang, F.: Red: Model-checker for timed automata with clock-restriction diagram. In: Workshop on Real-Time Tools. Dept. of Information Technology, Uppsala University, August 2001. Technical Report 2001–014, ISSN 1404–3203 (2001)

  32. Wang, F.: Symbolic verification of complex real-time systems with clock-restriction diagram. In: FORTE (2001)

  33. Wang, F.: Region encoding diagram for fully symbolic verification of real-time systems. In: The 24th COMPSAC. IEEE press (2000)

  34. Wang, F., Hsiung, P.-A.: Efficient and user-friendly verification. IEEE Trans. Comput. (2002)

  35. Wang, F., Huang, G.-D., Yu, F.: TCTL inevitability analysis of dense-time systems: from theory to engineering. IEEE Trans. Softw. Eng., 32(7) (a preliminary version of the work appears in the proceedings of 8th Conference on Implementation and Application of Automata (CIAA), July 2003, Santa Barbara, CA, USA; LNCS 2759, Springer, Berlin) (2006)

  36. Wang, F., Yao, L.-W., Yang, Y.-L.: Efficient verification of distributed real-time systems with broadcasting behaviors. Real Time Syst. J. 47(4), 285–318 (2011)

    Article  MATH  Google Scholar 

  37. Yovine, S.: Kronos: a verification tool for real-time systems. Int. J. Softw. Tools Technol. Transf., 1(1/2) (1997)

Download references

Author information

Authors and Affiliations

  1. Department 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

Corresponding author

Correspondence to Farn Wang.

Additional information

\(\mathbf{RED}\) 8 is available at http://sites.google.com/site/redlibtw/.

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

A preliminary version of the work appears in the proceedings of AMAST 2004, Stirling, UK, July 2004, LNCS 3116, Springer-Verlag.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, F. Model-checking fair dense-time systems with propositions and events. Int J Softw Tools Technol Transfer 17, 223–243 (2015). https://doi.org/10.1007/s10009-014-0312-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-014-0312-7

Keywords

Search

Navigation