Verification of asynchronous circuits by BDD-based model checking of Petri nets

Roig, O.; Cortadella, Jordi; Pastor, Enric

doi:10.1007/3-540-60029-9_50

Cited by 62 publications

(44 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The number in parenthesis indicates the number of stages in case of pipelines. We provide results for BFS traversal (BFS), chained traversal using a greedy ordering strategy (C Greedy) [14], and a token-traverse chained strategy (C Token) [16]. Our goal when presenting these experiments is to demonstrate the significant impact that the chaining methodology has on the efficiency of traversal.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Hybrid Reachability Analysis for Asynchronous Concurrent Systems

Pastor¹,

Peña²

2003

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Symbolic reachability analysis based on Binary Decision Diagrams (BDDs) is a technique that allows the implementation of efficient state space exploration algorithms. However, in practice it is well known that the BDD blowup problem limits the size of the systems that can be analyzed. Conversely, simulation is a low-cost state generation technique, although its effectiveness is limited due to its inherent sequentiality. We present a hybrid methodology that combines simulation and symbolic traversal in order to improve the state space exploration of large systems. The methodology concentrates on asynchronous concurrent systems, whose peculiarities are not fully exploited by other existing techniques for hybrid verification. Our approach exploits the information obtained from simulations to improve the knowledge of the state space, effectively guiding symbolic traversal. We demonstrate the applicability of this methodology in the verification of complex control-dominated asynchronous circuits.

show abstract

Section: Resultsmentioning

confidence: 99%

“…These observations have suggested alternative traversal algorithms, named chaining [14,15]. Chaining applies the individual TRs of events in a predetermined order such that the number of new states generated at each step is maximized.…”

Section: Reachability Analysismentioning

confidence: 99%

Efficient Hybrid Reachability Analysis for Asynchronous Concurrent Systems

Pastor¹,

Peña²

2003

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Variant a is a naive algorithm, b [2] and c [4] are algorithms from the literature. Variant d, together with automatic optimizations, is our contribution and will be presented in the next section.…”

Section: Transitive Closure : State Of the Artmentioning

confidence: 99%

“…Note that this algorithm no longer explores states in a strict BFS order, as when t 2 is applied after t 1 , it may discover successors of states obtained by the application of t 1 . The clusters are defined in [4] using structural heuristics that rely on the Petri net definition of the model, and try to maximize independence of clusters. This may allow to converge faster than in a or b which will need as many iterations as the state-space is deep.…”

Section: Transitive Closure : State Of the Artmentioning

confidence: 99%

See 1 more Smart Citation

Hierarchical Set Decision Diagrams and Automatic Saturation

Hamez

Thierry-Mieg

Kordon

2008

Applications and Theory of Petri Nets

View full text Add to dashboard Cite

Abstract. Shared decision diagram representations of a state-space have been shown to provide efficient solutions for model-checking of large systems. However, decision diagram manipulation is tricky, as the construction procedure is liable to produce intractable intermediate structures (a.k.a peak effect). The definition of the so-called saturation method has empirically been shown to mostly avoid this peak effect, and allows verification of much larger systems. However, applying this algorithm currently requires deep knowledge of the decision diagram data-structures, of the model or formalism manipulated, and a level of interaction that is not offered by the API of public DD packages. Hierarchical Set Decision Diagrams (SDD) are decision diagrams in which arcs of the structure are labeled with sets, themselves stored as SDD. This data structure offers an elegant and very efficient way of encoding structured specifications using decision diagram technology. It also offers, through the concept of inductive homomorphisms, unprecedented freedom to the user when defining the transition relation. Finally, with very limited user input, the SDD library is able to optimize evaluation of a transition relation to produce a saturation effect at runtime. We further show that using recursive folding, SDD are able to offer solutions in logarithmic complexity with respect to other DD. We conclude with some performances on well known examples.

show abstract

Verification of asynchronous circuits based on zero-suppressed BDDs

2001

View full text Add to dashboard Cite

Since asynchronous circuits do not use clocks and perform operations based on causality relation between signal transitions, it is regarded that higher speed implementation and lower power consumption implementation than synchronous circuits are possible. In the design verification, however, since the number of states increases essentially more than in synchronous circuits, the computational time required in the verification increases. Accordingly, this paper proposes realization of verification based on trace theory by using ZBDD operations. Moreover, we will show that the higher speed implementation is possible by using Petri nets with inhibitor arcs, reducing the ZBDD variables by performing the composition of modules beforehand, and using special ZBDD operations for Petri nets. Finally, we will package the proposed scheme and carry out verification of several asynchronous circuits. © 2001 Scripta Technica, Syst Comp Jpn, 32(2): 4354, 2001

show abstract

Verification of asynchronous circuits by BDD-based model checking of Petri nets

Cited by 62 publications

References 16 publications

Efficient Hybrid Reachability Analysis for Asynchronous Concurrent Systems

Efficient Hybrid Reachability Analysis for Asynchronous Concurrent Systems

Hierarchical Set Decision Diagrams and Automatic Saturation

Verification of asynchronous circuits based on zero-suppressed BDDs

Contact Info

Product

Resources

About