Once a correct, robust sensitization criterion has been found, there remains the task of incorporating this criterion in an algorithm which finds the longest path satisfying this criterion; such a path is often called a longest true path. The development of such an algorithm is the subject of this chapter and the argument that is to be made is twofold. First, the methods that have appeared in the literature thus far which claim to solve this problem may be viewed as different parameterizations of a single algorithm, and, second, that this algorithm can be modified to compute the viability procedure corresponding to the viability criterion devised in the last chapter.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- False Path Detection Algorithms
Patrick C. McGeer
Robert K. Brayton
- Springer US
- Chapter 3
in-adhesives, MKVS, Hellmich GmbH/© Hellmich GmbH, Zühlke/© Zühlke