Abstract
At this moment, there lacks a specification language for distributed real-time system properties involving states and events. There also lacks a language for fairness assumptions in dense-time systems. We have defined a new temporal logic, TECTL f, for the flexible specification of distributed real-time systems with constraints involving events, states, and fairness assumptions. Then we have also designed algorithms for model-checking TECTL f formulas. Finally, we have endeavored to implement and experiment the ideas in our tool, Red 5.1, and shown that the ideas could be used 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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alur, R., Courcoubetis, C., Dill, D.L.: Model Checking for Real-Time Systems. IEEE LICS (1990)
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)
Alur, R., Henzinger, T.A.: A really temporal logic. In: 30th IEEE FOCS, pp. 164–169 (1989)
Alur, R., Henzinger, T.A.: Real-Time Logics: Complexity and Expressiveness. Information and Computation 104, 35–77 (1993)
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)
Bozga, M., Daws, C., Maler, O.: Kronos: A model-checking tool for real-time systems. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, Springer, Heidelberg (1998)
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)
Bryant, R.E.: Graph-based Algorithms for Boolean Function Manipulation. IEEE Trans. Comput. C-35(8) (1986)
Clarke, E., Emerson, E.A.: Design and Synthesis of Synchronization Skeletons using Branching-Time Temporal Logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, Springer, Heidelberg (1982)
Chandy, Misra: Parallel Program Design - A Foundation. Addison-Wesley, Reading (1988)
Chaki, S., Clarke, E.M., Ouaknine, J., Sharygina, N., Sinha, N.: State/Event-based Software Model Checking. In: Boiten, E.A., Derrick, J., Smith, G.P. (eds.) IFM 2004. LNCS, vol. 2999, pp. 128–147. Springer, Heidelberg (2004)
Dill, D.L.: Timing Assumptions and Verification of Finite-state Concurrent Systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, Springer, Heidelberg (1990)
Emerson, E.A., Lei, C.-L.: Modalities for Model Checking: Branching Time Logic Strikes Back. Science of Computer Programming 8, 275–306 (1987)
Fourier, J.B. (reported in:) Analyse des travaux de l’Académie Royale des Sciences pendant l’année 1824, Partie Mathématique (1827)
Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic Model Checking for Real-Time Systems. IEEE LICS (1992)
Huth, M., Jagadeesan, R., Schmidt, D.: Modal transition systems: A foundation for three-valued program analysis. In: Sands, D. (ed.) ESOP 2001. LNCS, vol. 2028, p. 155. Springer, Heidelberg (2001)
Kindler, E., Vesper, T.: ESTL: A Temporal Logic for Events and States. In: Desel, J., Silva, M. (eds.) ICATPN 1998. LNCS, vol. 1420, p. 365. Springer, Heidelberg (1998)
Kozen, D.: Results on the propositional mu-calculus. Theoretical Computer Science 27, 333–354 (1983)
Shaw, A.: Communicating Real-Time State Machines. IEEE Transactions on Software Engineering 18(9) (September 1992)
De Nicola, R., Vaandrager, F.: Three Logics for Branching Bisimulation. Journal of the ACM (JACM) 42(2), 458–487 (1995)
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)
Wang, F.: Region Encoding Diagram for Fully Symbolic Verification of Real-Time Systems. In: The 24th COMPSAC, Taipei, Taiwan, ROC, October 2000, IEEE press, Los Alamitos (2000)
Wang, F.: RED: Model-checker for Timed Automata with Clock-Restriction Diagram. Workshop on Real-Time Tools, Technical Report 2001-014, ISSN 1404-3203, Dept. of Information Technology, Uppsala University (August 2001)
Wang, F.: Symbolic Verification of Complex Real-Time Systems with Clock- Restriction Diagram, Proceedings of FORTE, Cheju Island, Korea (August 2001)
Wang, F.: Efficient Verification of Timed Automata with BDD-like Data-Structures. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol. 2575, pp. 189–205. Springer, Heidelberg (2002)
Wang, F., Hsiung, P.-A.: Efficient and User-Friendly Verification. IEEE Transactions on Computers (January 2002)
Wang, F., Huang, G.-D., Yu, F.: TCTL Inevitability Analysis of Dense-Time Systems. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol. 2759, pp. 176–187. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, F. (2004). Model-Checking Distributed Real-Time Systems with States, Events, and Multiple Fairness Assumptions. In: Rattray, C., Maharaj, S., Shankland, C. (eds) Algebraic Methodology and Software Technology. AMAST 2004. Lecture Notes in Computer Science, vol 3116. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27815-3_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-27815-3_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22381-8
Online ISBN: 978-3-540-27815-3
eBook Packages: Springer Book Archive