Symbolic state-space generation of asynchronous systems using extensible decision diagrams

18Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a new type of canonical decision diagrams, which allows a more efficient symbolic state-space generation for general asynchronous systems by allowing on-the-fly extension of the possible state variable domains. After implementing both breadth-first and saturationbased state-space generation with this new data structure in our tool SmArT, we are able to exhibit substantial efficiency improvements with respect to traditional "static" decision diagrams. Since our previous works demonstrated that saturation outperforms breadth-first approaches, saturation with this new structure is now arguably the state-of-the-art algorithm for symbolic state-space generation of asynchronous systems. © Springer-Verlag Berlin Heidelberg 2009.

Cite

CITATION STYLE

APA

Wan, M., & Ciardo, G. (2009). Symbolic state-space generation of asynchronous systems using extensible decision diagrams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5404 LNCS, pp. 582–594). https://doi.org/10.1007/978-3-540-95891-8_52

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free