Sciweavers

472 search results - page 35 / 95
» Functional simulation using binary decision diagrams
Sort
View
DATE
1998
IEEE
103views Hardware» more  DATE 1998»
14 years 1 months ago
Efficient Encoding Schemes for Symbolic Analysis of Petri Nets
Petri nets are a graph-based formalism appropriate to model concurrentsystems such as asynchronouscircuits or network protocols. Symbolic techniques based on Binary Decision Diagr...
Enric Pastor, Jordi Cortadella
CORR
2008
Springer
64views Education» more  CORR 2008»
13 years 9 months ago
Implementing general belief function framework with a practical codification for low complexity
In this chapter, we propose a new practical codification of the elements of the Venn diagram in order to easily manipulate the focal elements. In order to reduce the complexity, t...
Arnaud Martin
ICCAD
1994
IEEE
114views Hardware» more  ICCAD 1994»
14 years 1 months ago
Performance-driven synthesis of asynchronous controllers
We examine the implications of a new hazard-free combinational logic synthesis method [8], which generates multiplexor trees from binary decision diagrams (BDDs) -- representation...
Kenneth Y. Yun, Bill Lin, David L. Dill, Srinivas ...
JFP
2006
113views more  JFP 2006»
13 years 9 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas
CAV
1993
Springer
127views Hardware» more  CAV 1993»
14 years 1 months ago
Symbolic Equivalence Checking
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...
Jean-Claude Fernandez, Alain Kerbrat, Laurent Moun...