Efficient verification of distributed real-time systems with broadcasting behaviors

Binary synchronization has been used extensively in the construction of mathematical models for the verification of embedded systems. Although it allows 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 article, 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 diagrams for the characterization of complex synchronizations among many processes. We present weakest precondition algorithms that take advantage of the just-mentioned BDD-like diagrams for the efficient verification of complex real-time systems. Finally, we report experiments and argue that the techniques could be useful in practice.

[1]  Farn Wang,et al.  Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures , 2004, IEEE Transactions on Software Engineering.

[2]  Wang Yi,et al.  UPPAAL in 1995 , 1996, TACAS.

[3]  Joseph Sifakis,et al.  Tools and Applications II: The IF Toolset , 2004 .

[4]  Robert E. Tarjan,et al.  Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[5]  Arne Skou,et al.  Modelling and analysis of a collision avoidance protocol using Spin and Uppaal , 1996, The Spin Verification System.

[6]  Satoshi Yamane,et al.  The symbolic model-checking for real-time systems , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

[7]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

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

[9]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[10]  Wolfgang Reisig,et al.  A Primer in Petri Net Design , 1992, Springer Compass International.

[11]  César Sánchez,et al.  Reusable models for timing and liveness analysis of middleware for distributed real-time and embedded systems , 2006, EMSOFT '06.

[12]  Farn Wang,et al.  Model-Checking Distributed Real-Time Systems with States, Events, and Multiple Fairness Assumptions , 2004, AMAST.

[13]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[14]  BerryGérard,et al.  The ESTEREL synchronous programming language , 1992 .

[15]  Kim G. Larsen,et al.  Model Checking via Reachability Testing for Timed Automata , 1997, TACAS.

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

[17]  Gerard J. Holzmann,et al.  The SPIN Model Checker - primer and reference manual , 2003 .

[18]  Joseph Sifakis,et al.  The IF Toolset , 2004, SFM.

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

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

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

[22]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[23]  Farn Wang,et al.  TCTL Inevitability Analysis of Dense-Time Systems: From Theory to Engineering , 2006, IEEE Transactions on Software Engineering.

[24]  Farn Wang,et al.  Efficient verification of timed automata with BDD-like data structures , 2004, International Journal on Software Tools for Technology Transfer.

[25]  Sergio Yovine,et al.  KRONOS: a verification tool for real-time systems , 1997, International Journal on Software Tools for Technology Transfer.

[26]  Gérard Berry,et al.  The Esterel Synchronous Programming Language: Design, Semantics, Implementation , 1992, Sci. Comput. Program..