Efficient reachability analysis on modular discrete-event systems using binary decision diagrams

A well known strategy for handling the exponential complexity of modular discrete event systems is to represent the state space symbolically, using binary decision diagrams (BBDs). In this paper, key success factors in the design of efficient BDD-based reachability algorithms for synthesis and verif...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Byrod, M., Lennartson, B., Vahidi, A., Akesson, K.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Automata Binary decision diagrams Boolean functions Data structures Discrete event systems Partitioning algorithms Reachability analysis Space exploration State-space methods
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!