Sciweavers

472 search results - page 44 / 95
» Functional simulation using binary decision diagrams
Sort
View
ITIIS
2010
186views more  ITIIS 2010»
13 years 3 months ago
Adaptive Binary Negative-Exponential Backoff Algorithm Based on Contention Window Optimization in IEEE 802.11 WLAN
IEEE 802.11 medium access control (MAC) employs the distributed coordination function (DCF) as the fundamental medium access function. DCF operates with binary exponential backoff...
Bum-Gon Choi, Ju Yong Lee, Min Young Chung
APN
2004
Springer
14 years 2 months ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo
ISAAC
2003
Springer
144views Algorithms» more  ISAAC 2003»
14 years 2 months ago
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Raffaella Gentilini, Alberto Policriti
EURODAC
1994
IEEE
148views VHDL» more  EURODAC 1994»
14 years 1 months ago
BiTeS: a BDD based test pattern generator for strong robust path delay faults
This paper presents an algorithm for generation of test patterns for strong robust path delay faults, i.e. tests that propagate the fault along a single path and additionally are ...
Rolf Drechsler
DATE
2000
IEEE
92views Hardware» more  DATE 2000»
14 years 19 days ago
An Efficient Heuristic Approach to Solve the Unate Covering Problem
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
Roberto Cordone, Fabrizio Ferrandi, Donatella Sciu...