نتایج جستجو برای: robdd

تعداد نتایج: 69  

1999
Amit Narayan Sunil P. Khatri Jawahar Jain Masahiro Fujita Robert K. Brayton Alberto Sangiovanni-Vincentelli

Reduced Ordered Binary Decision Diagrams (ROBDDs) have traditionally been built in a bottom-up fashion, through the recursive use of Bryant's apply procedure [4], or the ITE [2] procedure. With these methods, the intermediate peak memory utilization is often larger than the nal ROBDD size. This peak memory requirement limits the complexity of the circuits which can be processed using ROBDDS. Re...

2010
Gilles Geeraerts Gabriel Kalyon Tristan Le Gall Nicolas Maquet Jean-François Raskin

This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functions of the form θ : 2 7→ L, where P is a finite set of Boolean propositions and L is a finite distributive lattice. Such functions arise naturally in several verification problems. LVBDD are a natural generalisation of multi-ter...

Journal: :IEICE Transactions 2015
Masahiko Sakai Hidetomo Nabeshima

SUMMARY Pseudo-Boolean (PB) problems are Integer Linear Problem restricted to 0-1 variables. This paper discusses on acceleration techniques of PB-solvers that employ SAT-solving of combined CNFs each of which is produced from each PB-constraint via a binary decision diagram (BDD). Specifically, we show (i) an efficient construction of a reduced ordered BDD (ROBDD) from a constraint in band for...

Journal: :IEEE Transactions on Computational Social Systems 2023

Computation tree logic of knowledge (CTLK) can be used to specify many properties related privacy multiagent systems (MASs). Our previous work defined knowledge-oriented Petri nets (KPNs) formally describe both the interacting/collaborating process multiagents and their epistemic evolutions. KPN-based verification CTLK required obtain all reachable states, transition relation equivalence relati...

1993
Pi-Yu Chung Ibrahim N. Hajj Janak H. Patel

Pi-Yu Chung, Ibrahim N. Hajj, and Janak H. Patel Coordinated Science Laboratory and Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign Abstract In this paper we describe several ordering heuristics for shared, Reduced and Ordered Binary Decision Diagrams(ROBDDs). These heuristics have been tested on ISCAS and MCNC benchmark circuits. In all examples, th...

2002
Alexey Glebov Sergey Gavrilov David Blaauw Vladimir Zolotov Rajendran Panda Chanhee Oh

High-performance digital circuits are facing increasingly severe noise problems due to cross-coupled noise injection. Traditionally, noise analysis tools use the conservative assumption that all neighbors of a net can switch simultaneously, thereby producing the worst-case noise on a net. However, due to the logic correlations in the circuit, this worst-case noise may not be realizable, resulti...

Journal: :Chicago J. Theor. Comput. Sci. 2010
Kevin Henshall Peter Schachte Harald Søndergaard Leigh Whiting

This paper is concerned with the problem of Boolean approximation in the following sense: given a Boolean function class and an arbitrary Boolean function, what is the function’s best proxy in the class? Specifically, what is its strongest logical consequence (or envelope) in the class of affine Boolean functions. We prove various properties of affine Boolean functions and their representation ...

Journal: :Journal of Circuits, Systems, and Computers 2004
Otmane Aït Mohamed Xiaoyu Song Eduard Cerny Sofiène Tahar Zijian Zhou

Multiway Decision Graphs (MDGs) have recently been proposed as an efficient representation for RTL designs. In this paper, we illustrate the MDG-based formal verification technique on the example of the Island Tunnel Controller. We investigate several techniques on how to deal with the nontermination problem of abstract state exploration, including a novel method based on retiming and circuit t...

2007
AKHILESH SHRESTHA LIUDONG XING A. Shrestha

In this paper, we consider the problem of modeling and analyzing the application communication reliability of wireless sensor networks (WSN) with different topologies, including star, tree, mesh, and hierarchical clustering. We propose reliability measures that integrate the conventional connectivity-based network reliability with the sensing coverage measure of WSN. We apply a reduced ordered ...

1996
A.-M. Trullemans

Ending the logic synthesis, the technology mapping step maps the Boolean function on physical cells. This itep is based on a matching check, which complexity depends on the number of library cell inputs, and increases if don't cares are considered. The method presented here is based on fault analysis. Using a structural equivalent of the cell, it allows to prune dramatically the design space, a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید