Model-Checking Distributed Real-Time Systems with States, Events, and Multiple Fairness Assumptions

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.

[1]  Alan C. Shaw,et al.  Communicating Real-Time State Machines , 1992, IEEE Trans. Software Eng..

[2]  Chin-Laung Lei,et al.  Modalities for Model Checking: Branching Time Logic Strikes Back , 1987, Sci. Comput. Program..

[3]  Ekkart Kindler,et al.  ESTL: A Temporal Logic for Events and States , 1998, ICATPN.

[4]  Farn Wang,et al.  Region Encoding Diagram for fully symbolic verification of real-time systems , 2000, Proceedings 24th Annual International Computer Software and Applications Conference. COMPSAC2000.

[5]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[6]  Rocco De Nicola,et al.  Three logics for branching bisimulation , 1995, JACM.

[7]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[8]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[9]  Farn Wang,et al.  Efficient Data Structure for Fully Symbolic Verification of Real-Time Software Systems , 2000, TACAS.

[10]  Radha Jagadeesan,et al.  Modal Transition Systems: A Foundation for Three-Valued Program Analysis , 2001, ESOP.

[11]  Thomas A. Henzinger,et al.  A really temporal logic , 1994, JACM.

[12]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..

[13]  Thomas A. Henzinger,et al.  Symbolic model checking for real-time systems , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[14]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[15]  Joël Ouaknine,et al.  State/Event-Based Software Model Checking , 2004, IFM.

[16]  Wang Yi,et al.  UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems , 1996, Hybrid Systems.

[17]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[18]  Farn Wang,et al.  TCTL Inevitability Analysis of Dense-Time Systems , 2003, CIAA.

[19]  David L. Dill,et al.  Timing Assumptions and Verification of Finite-State Concurrent Systems , 1989, Automatic Verification Methods for Finite State Systems.

[20]  Farn Wang.  Efficient Verification of Timed Automata with BDD-Like Data-Structures , 2003, VMCAI.

[21]  R. BurchJ.,et al.  Symbolic model checking , 1992 .

[22]  Stavros Tripakis,et al.  Kronos: A Model-Checking Tool for Real-Time Systems , 1998, CAV.

[23]  Pao-Ann Hsiung,et al.  Efficient and User-Friendly Verification , 2002, IEEE Trans. Computers.

[24]  Farn Wang,et al.  Symbolic Verification of Complex Real-Time Systems with Clock-Restriction Diagram , 2001, FORTE.