Journal of the Japanese Society for Artificial Intelligence
Online ISSN : 2435-8614
Print ISSN : 2188-2266
Print ISSN:0912-8085 until 2013
Formal Verification Method Based on Binary Decision Diagrams for Distributed/Concurrent Systems
Satoshi YAMANE
Author information
MAGAZINE FREE ACCESS

1998 Volume 13 Issue 1 Pages 83-90

Details
Abstract

Distributed/concurrent systems consist of many concurrent processes, and behave on strict timing conditions. It is important to verify the timing conditions of distributed/concurrent systems. In this paper, we propose formal verification method based on Binary Decision Diagrams(BDDs) for distributed/concurrent systems as follows: (1) We encode timed Kripke structure into Binary Decision Diagrams corresponding to patterns of timing constraints. (2) We verify systems by symbolic model-checking, which consists of both inverse image computation and Difference Bounds Matrices(DBMs). We show our proposed method effective by some example.

Content from these authors
© 1998 The Japaense Society for Artificial Intelligence
Previous article Next article
feedback
Top