Results 1 
9 of
9
Verification of Asynchronous Circuits by BDDbased Model Checking of Petri Nets
 In 16th Int. Conf. on Application and Theory of Petri Nets, volume 935 of LNCS
, 1996
"... . This paper presents a methodology for the verification of speedindependent asynchronous circuits against a Petri net specification. The technique is based on symbolic reachability analysis, modeling both the specification and the gatelevel network behavior by means of boolean functions. These fu ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
. This paper presents a methodology for the verification of speedindependent asynchronous circuits against a Petri net specification. The technique is based on symbolic reachability analysis, modeling both the specification and the gatelevel network behavior by means of boolean functions. These functions are efficiently handled by using Binary Decision Diagrams. Algorithms for verifying the correctness of designs, as well as several circuit properties are proposed. Finally, the applicability of our verification method has been proven by checking the correctness of different benchmarks. 1 Introduction During these last few years, asynchronous circuits have gained interest due to their promising advantages, such as local synchronization, elimination of the clock skew problem, faster and less powerconsuming circuits, and high degree of modularity. However, the concurrent nature of asynchronous circuits makes them difficult to design because all transitions must be taken into account ...
Efficient Encoding Schemes for Symbolic Analysis of Petri Nets
 In Proc. Design, Automation and Test in Europe
, 1998
"... Petri nets are a graphbased formalism appropriate to model concurrentsystems such as asynchronouscircuits or network protocols. Symbolic techniques based on Binary Decision Diagrams (BDDs) have emerged as one of the strategies to overcome the state explosion problem in the analysis of systems model ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Petri nets are a graphbased formalism appropriate to model concurrentsystems such as asynchronouscircuits or network protocols. Symbolic techniques based on Binary Decision Diagrams (BDDs) have emerged as one of the strategies to overcome the state explosion problem in the analysis of systems modeled byPetri nets. The existing techniques for state encoding use a variableper place strategy that leads to encoding schemes with very low density. This drawback has been partially mitigated by using ZeroSuppressed BDDs, that provide a typical reduction of BDD sizes by a factor of two. This work presents novel encoding schemes for Petri nets. By using algebraic techniques to analyze the topology of the net, sets of places "structurally related" can be derived and encoded by only using a logarithmic number of boolean variables. Such approach allows to drastically decrease the number of variables for state encoding and reduce memory and CPU requirements significantly. 1 Introduction Petri ...
Advances in BDD reduction using Parallel Genetic Algorithms
"... Binary Decision Diagrams (BDDs) have proved to be a powerful representation for Boolean functions. Particularly, they are a very useful data structure for the symbolic model checking of digital circuits and other finite state systems, as well as other problems. Nevertheless, the size of the BDD r ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Binary Decision Diagrams (BDDs) have proved to be a powerful representation for Boolean functions. Particularly, they are a very useful data structure for the symbolic model checking of digital circuits and other finite state systems, as well as other problems. Nevertheless, the size of the BDD representation of these functions is highly dependent on the order of the function arguments, also called variables, and to nd such good ordering is an NPComplete problem. Many heuristics have been proposed to solve this problem, as the depthfirst traversal algorithm, one of the best known techniques, and the genetic algorithm found in [6]. In this paper, we present a improvement to them, through a parallel genetic algorithm, and compare its experimental results with those obtained from an interleavingbased implementation of the depthfirst traversal algorithm, applying them to the ISCAS85 benchmark circuits.
Variable Ordering of BDDs with Parallel Genetic Algorithms
"... Binary Decision Diagrams (BDDs) have proved to be a powerful representation for Boolean functions. ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Binary Decision Diagrams (BDDs) have proved to be a powerful representation for Boolean functions.
A cachebased parallel genetic algorithm for the BDD variable ordering problem
, 2000
"... Binary Decision Diagrams (BDDs) have proved to be a powerful representation for Boolean functions. Particularly, they are a very useful data structure for the symbolic model checking of digital circuits and other finite state systems, as well as other problems. Nevertheless, the size of the BDD repr ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Binary Decision Diagrams (BDDs) have proved to be a powerful representation for Boolean functions. Particularly, they are a very useful data structure for the symbolic model checking of digital circuits and other finite state systems, as well as other problems. Nevertheless, the size of the BDD representation of these functions is highly dependent on the order of the function arguments, also called variables, and to find such good ordering is an NPComplete problem. Many heuristics have been proposed to solve this problem, as our Parallel Genetic Algorithm presented in [4], where we got excellent results in terms of parallelization. Now, we present a new version of our algorithm, this time with a cache system, together with experimental results.
Applying Symbolic Model Checking to Process Algebras
"... The Simple systems form a class of process algebras whose operational semantics can be specified using finite state labelled transition systems. In this work, we describe how to efficiently derive the ordered Binary Decision Diagrams (BDDs) corresponding to the operational semantics of the terms of ..."
Abstract
 Add to MetaCart
The Simple systems form a class of process algebras whose operational semantics can be specified using finite state labelled transition systems. In this work, we describe how to efficiently derive the ordered Binary Decision Diagrams (BDDs) corresponding to the operational semantics of the terms of an arbitrary Simple system. Model checking using such BDDs can often speedup the testing of properties such as bisimilarity over direct algorithms. We also introduce a useful extension of Simple providing explicit recursion. For the CCS operators, we show that the corresponding BDD operators we generate automatically are comparable to those coded by hand. 1 Introduction Process algebras are coming into increasing use as specification tools for concurrent systems. Specifications are given as terms; the appropriate use of the algebra's operations lends useful structure to the specifications. As process algebraic specifications resemble programs, they appeal to programmers' intuitions. This st...
Searching for Synchronization Algorithms using BDDs
, 2001
"... this paper, we describe a case study in which we employed symbolic model checking using BDD and searched for synchronization algorithms. By employing symbolic model checking, we could speed up enumeration and verication of algorithms. We also discuss the use of approximation for reducing the sear ..."
Abstract
 Add to MetaCart
this paper, we describe a case study in which we employed symbolic model checking using BDD and searched for synchronization algorithms. By employing symbolic model checking, we could speed up enumeration and verication of algorithms. We also discuss the use of approximation for reducing the search space. 8!>Z5; =Q$N%$%s%Q%/%H$O!"4{B8$N>pJs%7%9%F%`$N8!>Z$r9T$&$@$1$G$J$/?7$7$$%7%9%F%`$r9g@.$7$?$jH/8+$7 $?$j$G$$F$3$=!"$h$jBg$$J$b$N$K$J$k$H9M$($i$l$k!#2f!9$O0JA0$N8&5f$K$*$$$F!"M?$($i$l$?;EMM $rK~$?$9?7$7$$%"%k%4%j%:%`$rH/8+$9$k$3$H$rL\E*$K%"%k%4%j%:%`$N6u4V$rDj5A$7!"<+F08!>Z7O$9$J $o$A%b%G%k8!::7O$rMQ$$$F!"$=$N6u4V$KB0$9$k%"%k%4%j%:%`$N0l$D0l$D$r;EMM$K>H$i$7$F8!::$9$k$3 $H$r;n$_$?!#$$$&$^$G$b$J$/!"$3$N%"%W%m!<%A$N:GBg$NLdBj$OC5:w6u4V$NGzH/$K$"$k!#K\O@J8$G$O!" BDD $K$h$k59fE*$J%b%G%k8!::$rMQ$$$FF14%"%k%4%j%:%`$rC5:w$7$?%1!<%9!&%9%?%G%#$K$D$$$F=R $Y$k!#59fE*$J%b%G%k8!::$rMQ$$$k$3$H$K$h$j!"%"%k%4%j%:%`$NLVMe$H8!>Z$N8zN($r8~>e$5$;$k$3$H $,$G$$?!#C5:w6