The BDD Space Complexity of Different Forms of Concurrency

• Autorzy: Baldamus M. , Schneider K.
• Języki publikacji: EN

Abstrakty

EN

The automated verification of concurrent systems by model checking is often confronted with the state space explosion problem. A widely adopted method to tackle this problem is to use binary decision diagrams (BDDs) for representing systems and state spaces implicitly. However, it may be that even the system representation itself is prohibitively large. It is therefore interesting to study which factors influence the size of a BDD that represents the transition relation of a system. In this article, we consider the BDD representations of synchronous, asynchronous, and interleaved processes with communication via shared variables and present upper bounds for their sizes. To this end, we introduce a general representation strategy where catastrophic exponential growth of the BDD can only be due to the specifics of communication and/or write conflict resolution; it is neither due to the number of processes nor to the concurrency discipline. Moreover, conditions on communication and write conflict resolution are presented that are sufficient for polynomial sized BDD representations.

Słowa kluczowe

EN

binary decision diagrams; concurrency; shared-variable model; complexity

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2002
• Tom: Vol. 50, nr 2
• Strony: 111--133
• Opis fizyczny: wykr., bibliogr. 15 poz.

Twórcy

autor

Baldamus M.

autor

Schneider K.

• Universität Karlsruhe, IRF, Postfach D-76128 Karlsruhe, Germany,