FARN WANG2018-09-102018-09-102005-11http://scholars.lib.ntu.edu.tw/handle/123456789/317816CSP-style synchronizations have been used extensively in the construction of mathematical models for the verification of embedded systems. Although they allow 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 paper, 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 data-structures for the characterization of complex synchronizations among many processes. We present weakest precondition algorithms that take advantage of the just-mentioned BDD-like data-structures for the efficient verification of complex realtime systems. Finally, we report experiments and argue that the techniques could be useful in practice. © Springer-Verlag Berlin Heidelberg 2005.[SDGs]SDG17conference paper10.1007/11576280_212-s2.0-33646785063WOS:000233804300020