Search: onr:"swepub:oai:research.chalmers.se:60a5e8a8-1b27-4582-8c8a-11b87c20272c" >
Efficient Reachabil...
Efficient Reachability Analysis on Modular Discrete-Event Systems using Binary Decision Diagrams
-
- Byröd, Martin, 1980 (author)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Lennartson, Bengt, 1956 (author)
- Chalmers tekniska högskola,Chalmers University of Technology
-
- Vahidi Mazinani, Arash, 1974 (author)
- Chalmers tekniska högskola,Chalmers University of Technology
-
show more...
-
- Åkesson, Knut, 1972 (author)
- Chalmers tekniska högskola,Chalmers University of Technology
-
show less...
-
(creator_code:org_t)
- ISBN 1424400538
- 2006
- 2006
- English.
-
In: 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
- Related links:
-
http://dx.doi.org/10...
-
show more...
-
https://doi.org/10.1...
-
https://research.cha...
-
show less...
Abstract
Subject headings
Close
- 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.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Publication and Content Type
- kon (subject category)
- ref (subject category)
Find in a library
To the university's database