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 c...

Full description

Saved in:
Bibliographic Details
Published inReal-time systems Vol. 47; no. 4; pp. 285 - 318
Main Authors Wang, Farn, Yao, Li-Wei, Yang, Ya-Lan
Format Journal Article
LanguageEnglish
Published Boston Springer US 01.07.2011
Springer Nature B.V
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0922-6443
1573-1383
DOI:10.1007/s11241-011-9122-0