Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aceto L, Bergueno A, Larsen KG (1998) Model checking via reachability testing for timed automata. In: Steffen B (ed) 4th TACAS. LNCS, vol 1384, pp 263–280
Alur R, Courcoubetis C, Dill DL (1993) Model-checking in dense real-time. Inf Comput 104(1):2–34
Alur R, Dill DL (1994) A theory of timed automata. Theor Comput Sci 126:183–235
Bengtsson J, Larsen KG, Larsson F, Pettersson P, Yi W (1996) Uppaal—a tool suite for automatic verification of real-time systems. In: Workshop on tools and algorithms for the construction and analysis of systems. LNCS, vol 1055. Springer, Berlin, pp 431–434
Berry G, Gonthier G (1992) The esterel synchronous programming language: design, semantics, implementation. Sci Comput Program 19:87–152
Bozga M, Graf S, Ober I, Ober I, Sifakis J (2004) The if toolset. In: Formal methods for the design of real-time systems. LNCS, vol 3185. Springer, Berlin
Bryant RE (1986) Graph-based algorithms for boolean function manipulation. IEEE Trans Comput C-35(8)
Burch J, Clarke EM, McMillan KL, Dill DL, Hwang L (1990) Symbolic model checking: 1020 states and beyond. In: IEEE LICS
Dill DL (1989) Timing assumptions and verification of finite-state concurrent systems. In: CAV. LNCS, vol 407. Springer, Berlin
Fourier J (1827) In: (reported in:) Analyse des travaux de l’Académie Royale des Sciences pendant l’année 1824. Partie Mathématique
Gabow HN, Galil Z, Spencer T, Tarjan RE (1986) Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6(2):109–122
Henzinger TA, Nicollin X, Sifakis J, Yovine S (1994) Symbolic model checking for real-time systems. Inf Comput 111:193–244. A preliminary version appeared in the Proceedings of the seventh annual symposium on logic in computer science (LICS), IEEE Comput Soc Press (1992), pp 394–406
Hoare C (1985) Communicating sequential processes. Prentice Hall, New York
Holzmann GJ (2004) The Spin model checker—primer and reference manual. Addison-Wesley, Reading
Jensen HE, Larsen KG, Skou A (1996) Modelling and analysis of a collision avoidance protocol using spin and uppaal. In: 2nd SPIN workshop
Reisig W (1992) A primer in Petri net design. Springer, Berlin
Subramonian V, Gill C, Sánchez C, Simpa HB (2006) Reusable models for timing and liveness analysis of middleware for distributed real-time and embedded systems. In: EMSOFT
Wang F (2004a) Model-checking distributed real-time systems with states, events, and multiple fairness assumptions. A preliminary version of the work appears in the proceedings of AMAST 2004, LNCS, vol 3116, Springer, Berlin
Wang F (2004b) Efficient verification of timed automata with bdd-like data-structures. STTT (Software Tools for Technology Transfer), 6(1). Special issue for the 4th VMCAI, Jan 2003, LNCS, vol 2575, Springer, Berlin
Wang F (2005) Symbolic parametric safety analysis of linear hybrid systems with bdd-like data-structures. IEEE Trans Softw Eng 31(1):38–51. A preliminary version is in proceedings of 16th CAV, 2004, LNCS, vol 3114, Springer, Berlin
Wang F, Huang G-D, Yu F (2006) 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 CIAA (Conference on Implementation and Application of Automata), July 2003, Santa Barbara, CA, USA; LNCS, vol 2759, Springer, Berlin
Yovine S (1997) Kronos: a verification tool for real-time systems. Int J Softw Tools Technol Transf 1(1/2), October 1997
Author information
Authors and Affiliations
Corresponding author
Additional information
RED 8.0 is available at project REDLIB of SourceForge.
The work is partially supported by grant NSC 97-2221-E-002-129-MY3 from NSC, Taiwan, ROC and by a research grant from Research Center for Information Technology Innovation, Academia Sinica, Taiwan, ROC in 2010. A preliminary version of the manuscript is in the Proceedings of the 7th ICFEM (International Conference on Formal Engineering Methods), Nov. 2005, Manchester, UK, LNCS 3785, Springer-Verlag.
Rights and permissions
About this article
Cite this article
Wang, F., Yao, LW. & Yang, YL. Efficient verification of distributed real-time systems with broadcasting behaviors. Real-Time Syst 47, 285–318 (2011). https://doi.org/10.1007/s11241-011-9122-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-011-9122-0