A well known strategy for handling the exponential complexity of modular discrete event systems is to represent the state space symbolically rather than explicitly, using binary decision diagrams (BBDs). In this paper, key success factors in the design of efcient BDD-based reachability algorithms for synthesis and verification are discussed. Furthermore, it is 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. Finally, a recently introduced reachability algorithm based on these principles is discussed and a proof of correctness for this algorithm is given
Binary decision diagrams (BDDs) are the state-of-the-art core technique for the symbolic representat...
Simulation used to be the most common technique to test the correctness of a system. However, the co...
. In this paper we discuss the problem of calculating the reachable states of a dynamical system def...
A well known strategy for handling the exponential complexity of modular discrete event systems is t...
Efficient analysis and controller synthesis in the context of Discrete-Event Systems (DES) is discus...
The state-space explosion problem, resulting from the reachability computation of the synthesis task...
Due to the state-space explosion, many synthesis and verification problems for discrete event system...
The state-space explosion problem, resulting from the reachability computation of the synthesis task...
Verification techniques using symbolic state space traversal rely on efficient algorithms based on B...
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success ...
Symbolic reachability analysis based on Binary Decision Diagrams (BDDs) is a technique that al-lows ...
AbstractBinary Decision Diagrams (BDDs) and their multi-terminal extensions have shown to be very he...
Due to the ever-increasing complexity of software and hardware, it is becoming more and more importa...
Decision diagrams are used in symbolic verification to concisely represent state spaces. A crucial s...
Abstract — This paper shows how to generate a finite-vertex graph, called a reachability graph for d...
Binary decision diagrams (BDDs) are the state-of-the-art core technique for the symbolic representat...
Simulation used to be the most common technique to test the correctness of a system. However, the co...
. In this paper we discuss the problem of calculating the reachable states of a dynamical system def...
A well known strategy for handling the exponential complexity of modular discrete event systems is t...
Efficient analysis and controller synthesis in the context of Discrete-Event Systems (DES) is discus...
The state-space explosion problem, resulting from the reachability computation of the synthesis task...
Due to the state-space explosion, many synthesis and verification problems for discrete event system...
The state-space explosion problem, resulting from the reachability computation of the synthesis task...
Verification techniques using symbolic state space traversal rely on efficient algorithms based on B...
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success ...
Symbolic reachability analysis based on Binary Decision Diagrams (BDDs) is a technique that al-lows ...
AbstractBinary Decision Diagrams (BDDs) and their multi-terminal extensions have shown to be very he...
Due to the ever-increasing complexity of software and hardware, it is becoming more and more importa...
Decision diagrams are used in symbolic verification to concisely represent state spaces. A crucial s...
Abstract — This paper shows how to generate a finite-vertex graph, called a reachability graph for d...
Binary decision diagrams (BDDs) are the state-of-the-art core technique for the symbolic representat...
Simulation used to be the most common technique to test the correctness of a system. However, the co...
. In this paper we discuss the problem of calculating the reachable states of a dynamical system def...
Add to ORKG