CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Efficient Reachability Analysis on Modular Discrete-Event Systems using Binary Decision Diagrams

Martin Byröd (Institutionen för signaler och system, Automation) ; Bengt Lennartson (Institutionen för signaler och system, Automation) ; Arash Vahidi (Institutionen för signaler och system, Automation) ; Knut Åkesson (Institutionen för signaler och system, Automation)
8th International Workshop on Discrete Event Systems, WODES 2006; Ann Arbor, MI; United States; 10 July 2006 through 12 July 2006 p. 288-293. (2006)
[Konferensbidrag, refereegranskat]

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 verification are discussed. It is also shown how the modular structure of a discrete event system (DES) can be utilized by taking advantage of the process communication graph and partitioning techniques. A reachability algorithm based on these principles is discussed and a proof of correctness for the algorithm is given.



Denna post skapades 2006-08-25. Senast ändrad 2016-10-21.
CPL Pubid: 19991

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för signaler och system, Automation (2005-2017)

Ämnesområden

Information Technology

Chalmers infrastruktur