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

Tyck till om SwePub Sök här!

Byröd, Martin, 1980 (författare): Chalmers tekniska högskola,Chalmers University of Technology

Lennartson, Bengt, 1956 (författare): Chalmers tekniska högskola,Chalmers University of Technology

Vahidi Mazinani, Arash, 1974 (författare): Chalmers tekniska högskola,Chalmers University of Technology

Åkesson, Knut, 1972 (författare): Chalmers tekniska högskola,Chalmers University of Technology

(creator_code:org_t)

ISBN 1424400538
2006
2006
Engelska.
Ingår i: 8th International Workshop on Discrete Event Systems, WODES 2006; Ann Arbor, MI; United States; 10 July 2006 through 12 July 2006. - 1424400538 ; , s. 288-293

Relaterad länk:: http://dx.doi.org/10...; visa fler...; https://doi.org/10.1...; https://research.cha...; visa färre...

Abstract Ämnesord

Stäng

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.

Av författaren/redakt...: Byröd, Martin, 1 ...; Lennartson, Beng ...; Vahidi Mazinani, ...; Åkesson, Knut, 1 ...

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.