Search results for "OBDD"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
100	Tianlong Gu, Huadong Liu	The symbolic OBDD scheme for generating mechanical assembly sequences.	Formal Methods Syst. Des.	2008	DBLP DOI BibTeX RDF	Assemble sequence planning, Assembly liaison graph, Assembly sequences generation, Ordered binary decision diagram
100	Jochen Bern, Christoph Meinel, Anna Slobodová	Global rebuilding of OBDD's avoiding memory requirement maxima.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1996	DBLP DOI BibTeX RDF
79	Christoph Meinel, Anna Slobodová	On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams.	MFCS	1994	DBLP DOI BibTeX RDF
79	Hitomi Sato, Yoshihiro Yasue, Yusuke Matsunaga, Masahiro Fujita	Boolean Resubstitution with Permissible Functions and Binary Decision Diagrams.	DAC	1990	DBLP DOI BibTeX RDF
74	Tao Feng 0012, Li-C. Wang, Kwang-Ting Cheng, Chih-Chan Lin	Using 2-domain partitioned OBDD data structure in an enhanced symbolic simulator.	ACM Trans. Design Autom. Electr. Syst.	2005	DBLP DOI BibTeX RDF	Formal verification, equivalence checking, symbolic simulation
74	Daniel Sawitzki	Lower Bounds on the OBDD Size of Graphs of Some Popular Functions.	SOFSEM	2005	DBLP DOI BibTeX RDF
74	Yung-Ruei Chang, Suprasad V. Amari, Sy-Yen Kuo	Computing System Failure Frequencies and Reliability Importance Measures Using OBDD.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF	Failure frequency, reliability importance measure, imperfect coverage, fault tolerance, BDD, system availability
65	Jörn Ossowski, Christel Baier	A uniform framework for weighted decision diagrams and its implementation.	Int. J. Softw. Tools Technol. Transf.	2008	DBLP DOI BibTeX RDF
61	Beate Bollig, Niko Range, Ingo Wegener	Exact OBDD Bounds for Some Fundamental Functions.	SOFSEM	2008	DBLP DOI BibTeX RDF	Computational complexity, lower bounds, ordered binary decision diagrams
61	Gang Xu, Wei Xu, Tao Huang 0001	Extending OBDD Graphs for Composite Event Matching in Content-based Pub/Sub Systems.	ISPDC	2005	DBLP DOI BibTeX RDF
61	Gang Xu, Wei Xu, Tao Huang 0001	Extending OBDD Graphs for Composite Event Matching in Content-Based Pub/Sub Systems.	ACIS-ICIS	2005	DBLP DOI BibTeX RDF
61	Yung-Ruei Chang, Hung-Yau Lin, Ing-Yi Chen, Sy-Yen Kuo	A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD.	COMPSAC	2003	DBLP DOI BibTeX RDF
61	Yung-Ruei Chang, Suprasad V. Amari, Sy-Yen Kuo	Reliability Evaluation of Multi-state Systems Subject to Imperfect Coverage using OBDD.	PRDC	2002	DBLP DOI BibTeX RDF
61	Yu-Liang Wu, Hongbing Fan, Malgorzata Marek-Sadowska, C. K. Wong	OBDD Minimization Based on Two-Level Representation of Boolean Functions.	IEEE Trans. Computers	2000	DBLP DOI BibTeX RDF	optimum variable ordering, formal verification, CAD, Binary Decision Diagram
61	Rune Møller Jensen, Manuela M. Veloso	OBDD-based Universal Planning: Specifying and Solving Planning Problems for Synchronized Agents in Non-deterministic Domains.	Artificial Intelligence Today	1999	DBLP DOI BibTeX RDF
61	Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara	On the Hardness of Approximating the Minimum Consistent OBDD Problem.	SWAT	1996	DBLP DOI BibTeX RDF
59	Fei Xue, Lu Yan	Formal approach to fault diagnosis in distributed discrete event systems with OBDD.	Innov. Syst. Softw. Eng.	2007	DBLP DOI BibTeX RDF	Petri net, Fault diagnosis, Discrete event system, OBDD
59	Yung-Ruei Chang, Suprasad V. Amari, Sy-Yen Kuo	OBDD-Based Evaluation of Reliability and Importance Measures for Multistate Systems Subject to Imperfect Fault Coverage.	IEEE Trans. Dependable Secur. Comput.	2005	DBLP DOI BibTeX RDF	multistate system, importance measure, Reliability, fault-coverage, OBDD
52	Daniel Sawitzki	The Complexity of Problems on Implicitly Represented Inputs.	SOFSEM	2006	DBLP DOI BibTeX RDF
52	Pietro Torasso, Gianluca Torta	Computing Minimum-Cardinality Diagnoses Using OBDDs.	KI	2003	DBLP DOI BibTeX RDF
52	Christoph Meinel, Anna Slobodová	A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams.	STACS	1997	DBLP DOI BibTeX RDF
52	Ingo Wegener	The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions.	WG	1993	DBLP DOI BibTeX RDF
52	Don E. Ross, Kenneth M. Butler, M. Ray Mercer	Exact ordered binary decision diagram size when representing classes of symmetric functions.	J. Electron. Test.	1991	DBLP DOI BibTeX RDF	Boolean function representation, Binary decision diagram, symbolic simulation, symmetric functions, ordered binary decision diagram
48	Daniel Sawitzki	Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.	LATIN	2006	DBLP DOI BibTeX RDF
48	Rudolf Berghammer, Frank Neumann 0001	RelView - An OBDD-Based Computer Algebra System for Relations.	CASC	2005	DBLP DOI BibTeX RDF
48	Philipp Woelfel	New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing.	STACS	2001	DBLP DOI BibTeX RDF
48	Beate Bollig, Ingo Wegener	Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems.	ICALP	2000	DBLP DOI BibTeX RDF
48	Martin Sauerhoff, Ingo Wegener	On the complexity of minimizing the OBDD size for incompletely specified functions.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1996	DBLP DOI BibTeX RDF
48	Rolf Drechsler, Nicole Göckel, Bernd Becker 0001	Learning Heuristics for OBDD Minimization by Evolutionary Algorithms.	PPSN	1996	DBLP DOI BibTeX RDF
46	Yuke Wang, Mostafa I. H. Abd-El-Barr, Carl McCrosky	An Algorithm for Total Symmetric OBDD Detection.	IEEE Trans. Computers	1997	DBLP DOI BibTeX RDF	algorithms, data structures, Boolean function, symmetry, OBDD
46	Mark A. Heap, M. Ray Mercer	Least Upper Bounds an OBDD Sizes.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	least upper bounds, OBDD sizes, exact equations, nonterminal vertexes, reduced ordered binary decision diagrams, Boolean functions, decoding
46	Jordan Gergov, Christoph Meinel	Efficient Boolean Manipulation With OBDD's can be Extended to FBDD's.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	Boolean manipulation, Boolean function manipulation, equivalence test, satisfiability test, tautology test, total computation, data structures, data structure, Boolean functions, logic design, circuit design, OBDD, canonical representations
43	Bogdan J. Falkowski, Chip-Hong Chang	Efficient Algorithms for the Calculation of Arithmetic Spectrum from OBDD & Synthesis of OBDD from Arithmetic Spectrum for Incompletely Specified Boolean Functions.	ISCAS	1994	DBLP DOI BibTeX RDF
43	Jordan Gergov, Christoph Meinel	Mod-2-OBDD's: A Generalization of OBDD's and EXOR-Sum-of-Products	Universität Trier, Mathematik/Informatik, Forschungsbericht	1993	RDF
39	Raffaella Gentilini, Carla Piazza, Alberto Policriti	Symbolic Graphs: Linear Solutions to Connectivity Related Problems.	Algorithmica	2008	DBLP DOI BibTeX RDF	Massive graphs, Model checking, Ordered binary decision diagrams, Biconnected components, Strongly connected components
39	Nathan Segerlind	On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs.	CCC	2008	DBLP DOI BibTeX RDF	lower bounds, resolution, ordered binary decision diagrams, propositional proof complexity
39	Gang Xu, Wei Xu, Tao Huang 0001	An Extended Event Matching Approach in Content-based Pub/Sub Systems for EAI.	EDOC	2005	DBLP DOI BibTeX RDF
39	Daniel Sawitzki	Experimental Studies of Symbolic Shortest-Path Algorithms.	WEA	2004	DBLP DOI BibTeX RDF
39	Daniel Sawitzki	A Symbolic Approach to the All-Pairs Shortest-Paths Problem.	WG	2004	DBLP DOI BibTeX RDF
39	Shuo Sheng, Michael S. Hsiao	Efficient Preimage Computation Using A Novel Success-Driven ATPG.	DATE	2003	DBLP DOI BibTeX RDF
39	Philipp Woelfel	Symbolic Topological Sorting with OBDDS.	MFCS	2003	DBLP DOI BibTeX RDF
39	Randal E. Bryant, Miroslav N. Velev	Boolean satisfiability with transitivity constraints.	ACM Trans. Comput. Log.	2002	DBLP DOI BibTeX RDF	formal verification, decision procedures, Boolean satisfiability
39	Ganapathy Parthasarathy, Madhu K. Iyer, Tao Feng 0012, Li-C. Wang, Kwang-Ting Cheng, Magdy S. Abadir	Combining ATPG and Symbolic Simulation for Efficient Validation of Embedded Array Systems.	ITC	2002	DBLP DOI BibTeX RDF
39	Jan Friso Groote, Jaco van de Pol	Equational Binary Decision Diagrams.	LPAR	2000	DBLP DOI BibTeX RDF
39	Henrik Hulgaard, Poul Frederick Williams, Henrik Reif Andersen	Equivalence checking of combinational circuits using Boolean expression diagrams.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1999	DBLP DOI BibTeX RDF
39	Mitchell A. Thornton, V. S. S. Nair	Behavioral synthesis of combinational logic using spectral-based heuristics.	ACM Trans. Design Autom. Electr. Syst.	1999	DBLP DOI BibTeX RDF	logic design, decision diagrams, spectral methods, automatic synthesis, design aids
39	Jan Behrens, Stephan Waack	Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering.	STACS	1998	DBLP DOI BibTeX RDF
39	Kazuyoshi Hayase, Hiroshi Imai	OBDDs of a Monotone Function and of Its Prime Implicants.	ISAAC	1996	DBLP DOI BibTeX RDF
39	Kenneth L. McMillan	A Conjunctively Decomposed Boolean Representation for Symbolic Model Checking.	CAV	1996	DBLP DOI BibTeX RDF
39	Jochen Bern, Christoph Meinel, Anna Slobodová	Global rebuilding of OBDDs Avoiding Memory Requirement Maxima.	CAV	1995	DBLP DOI BibTeX RDF
39	Petr Savický, Ingo Wegener	Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams.	FSTTCS	1994	DBLP DOI BibTeX RDF
38	Serge Haddad, Jean-Michel Ilié, Kais Klai	Design and Evaluation of a Symbolic and Abstraction-Based Model Checker.	ATVA	2004	DBLP DOI BibTeX RDF	Model Checking, Abstraction, OBDD
38	Martin Sauerhoff	Randomized Branching Programs.	SAGA	2001	DBLP DOI BibTeX RDF	Randomized branching program, read-k-times, linear-length, lower bounds, randomness, nondeterminism, OBDD
38	Martin Keim, Bernd Becker 0001, Birgitta Stenner	On the (non-)resetability of synchronous sequential circuits.	VTS	1996	DBLP DOI BibTeX RDF	nonresetability, OBDD algorithm, three-valued based greedy algorithm, design, sequential circuits, synchronisation, heuristic algorithm, synchronous sequential circuit, synchronizing sequence, memory elements, resetability
34	Beate Bollig	On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem.	SOFSEM	2009	DBLP DOI BibTeX RDF	variable ordering problem, Computational complexity, ordered binary decision diagrams, threshold functions
34	Beate Bollig	On the OBDD Complexity of the Most Significant Bit of Integer Multiplication.	TAMC	2008	DBLP DOI BibTeX RDF	Computational complexity, lower bounds, ordered binary decision diagrams, integer multiplication
34	Pietro Torasso, Gianluca Torta	Model-Based Diagnosis Through OBDD Compilation: A Complexity Analysis.	Reasoning, Action and Interaction in AI Theories and Systems	2006	DBLP DOI BibTeX RDF
34	Klaus Meer, Dieter Rautenbach	On the OBDD Size for Graphs of Bounded Tree- and Clique-Width.	IWPEC	2006	DBLP DOI BibTeX RDF
34	Fu-Min Yeh, Hung-Yau Lin, Sy-Yen Kuo	Analyzing Network Reliability With Imperfect Nodes Using OBDD.	PRDC	2002	DBLP DOI BibTeX RDF
34	Jawahar Jain, Ingo Wegener, Masahiro Fujita	A Note on Complexity of OBDD Composition and Efficiency of Partitioned-OBDDs over OBDDs.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	Partitioned-OBDDs, composition, OBDDs
34	E. Pascal Gribomont, Nachaat Salloum	System Description: Using OBDD's for the validation of Skolem verification conditions.	CADE	1999	DBLP DOI BibTeX RDF
34	Martin Sauerhoff	Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables.	FSTTCS	1999	DBLP DOI BibTeX RDF
34	Detlef Sieling	On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract).	STACS	1998	DBLP DOI BibTeX RDF
34	Christoph Meinel, Thorsten Theobald	On the Influence of the State Encoding on OBDD-Representations of Finite State Machines.	MFCS	1997	DBLP DOI BibTeX RDF
34	Can Ökmen, Martin Keim, Rolf Krieger, Bernd Becker 0001	On Optimizing BIST-Architecture by Using OBDD-based Approaches and Genetic Algorithms.	VTS	1997	DBLP DOI BibTeX RDF	input probability, weighted random pattern generation (WRPG), genetic algorithm, Build in self test (BIST)
26	Dan Olteanu, Jiewen Huang	Secondary-storage confidence computation for conjunctive queries with inequalities.	SIGMOD Conference	2009	DBLP DOI BibTeX RDF	query processing, decision diagrams, probabilistic databases
26	Dana Ron, Gilad Tsur	Testing Computability by Width Two OBDDs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
26	Sebastian Rudolph, Markus Krötzsch, Pascal Hitzler	Description Logic Reasoning with Decision Diagrams: Compiling SHIQ to Disjunctive Datalog.	ISWC	2008	DBLP DOI BibTeX RDF
26	Sonia A. Hashish, Ahmed Karmouch	Topology-based on-board data dissemination approach for sensor network.	MOBIWAC	2007	DBLP DOI BibTeX RDF	sensor networks, trajectories, data dissemination, push, pull
26	Roy Armoni, Dmitry Korchemny, Andreas Tiemeyer, Moshe Y. Vardi, Yael Zbar	Deterministic Dynamic Monitors for Linear-Time Assertions.	FATES/RV	2006	DBLP DOI BibTeX RDF
26	André Gronemeier	Approximating Boolean Functions by OBDDs.	MFCS	2004	DBLP DOI BibTeX RDF
26	Daniel Sawitzki	Implicit Flow Maximization by Iterative Squaring.	SOFSEM	2004	DBLP DOI BibTeX RDF
26	Shin-ichi Minato	Zero-suppressed BDDs and their applications.	Int. J. Softw. Tools Technol. Transf.	2001	DBLP DOI BibTeX RDF	Boolean function, BDD, Combinatorial problem, VLSI CAD, ZBDD
26	Takashi Horiyama, Toshihide Ibaraki	Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams.	ISAAC	2001	DBLP DOI BibTeX RDF
26	Wolfgang Günther 0001, Rolf Drechsler	Implementation of Read- k-times BDDs on Top of Standard BDD Packages.	VLSI Design	2001	DBLP DOI BibTeX RDF
26	Takashi Horiyama, Toshihide Ibaraki	Ordered Binary Decision Diagrams as Knowledge-Bases.	ISAAC	1999	DBLP DOI BibTeX RDF
26	Sagi Katz, Orna Grumberg, Daniel Geist	"Have I written enough Properties?" - A Method of Comparison between Specification and Implementation.	CHARME	1999	DBLP DOI BibTeX RDF
26	Rolf Drechsler, Bernd Becker 0001	Ordered Kronecker functional decision diagrams-a data structure for representation and manipulation of Boolean functions.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1998	DBLP DOI BibTeX RDF
26	Harry Preuß, Anand Srivastav	Blockwise Variable Orderings for Shared BDDs.	MFCS	1998	DBLP DOI BibTeX RDF
26	Anna Slobodová, Christoph Meinel	Sample Method for Minimization of OBDDs.	SOFSEM	1998	DBLP DOI BibTeX RDF
26	Hiroshi Sawada, Shigeru Yamashita, Akira Nagoya	Restricted Simple Disjunctive Decompositions Based on Grouping Symmetric Variables.	Great Lakes Symposium on VLSI	1997	DBLP DOI BibTeX RDF
26	Jochen Bern, Christoph Meinel, Anna Slobodová	Some heuristics for generating tree-like FBDD types.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1996	DBLP DOI BibTeX RDF
26	Randal E. Bryant	Binary decision diagrams and beyond: enabling technologies for formal verification.	ICCAD	1995	DBLP DOI BibTeX RDF
26	Kenneth L. McMillan	Hierarchical Representations of Discrete Functions, with Application to Model Checking.	CAV	1994	DBLP DOI BibTeX RDF
26	Masahiro Fujita, Hisanori Fujisawa, Yusuke Matsunaga	Variable ordering algorithms for ordered binary decision diagrams and their evaluation.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1993	DBLP DOI BibTeX RDF
26	C. Leonard Berman	Circuit width, register allocation, and ordered binary decision diagrams.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1991	DBLP DOI BibTeX RDF
25	Jarek Rossignac	Ordered Boolean List (OBL): Reducing the Footprint for Evaluating Boolean Expressions.	IEEE Trans. Vis. Comput. Graph.	2011	DBLP DOI BibTeX RDF	Boolean expression evaluation cost, CSG, OBDD
25	Detlef Sieling	Minimization Problems for Parity OBDDs.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Parity OBDD, Nonapproximability
25	Martin Sauerhoff	On the size of randomized OBDDs and read-once branching programs for k-stable functions.	Comput. Complex.	2001	DBLP DOI BibTeX RDF	read-once branching program, zero error, lower bounds, randomness, communication complexity, OBDD
21	Thomas Jansen 0001, Christine Zarges	Experimental and Theoretical Analysis of Local Search Optimising OBDD Variable Orderings.	EvoStar	2024	DBLP DOI BibTeX RDF
21	Sergei Ovcharov	OBDD(Join) Proofs Cannot Be Balanced.	MFCS	2023	DBLP DOI BibTeX RDF
21	Dmitry Itsykson, Artur Riazanov	Automating OBDD proofs is NP-hard.	Electron. Colloquium Comput. Complex.	2022	DBLP BibTeX RDF
21	Anna Bernasconi 0001, Valentina Ciriani, Marco Longhi	On the Optimal OBDD Representation of 2-XOR Boolean Affine Spaces.	DATE	2022	DBLP DOI BibTeX RDF
21	Dmitry Itsykson, Artur Riazanov	Automating OBDD proofs is NP-hard.	MFCS	2022	DBLP DOI BibTeX RDF
21	Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov 0001	Lower Bounds on OBDD Proofs with Several Orders.	ACM Trans. Comput. Log.	2021	DBLP DOI BibTeX RDF
21	Igor Razgon	Classification of OBDD size for monotone 2-CNFs.	Electron. Colloquium Comput. Complex.	2021	DBLP BibTeX RDF
21	Igor Razgon	Classification of OBDD size for monotone 2-CNFs.	CoRR	2021	DBLP BibTeX RDF
21	Leifeng He, Guanjun Liu	Petri Net Based CTL Model Checking: Using a New Method to Construct OBDD Variable Order.	TASE	2021	DBLP DOI BibTeX RDF
21	Igor Razgon	Classification of OBDD Size for Monotone 2-CNFs.	IPEC	2021	DBLP DOI BibTeX RDF
21	Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov 0001	On OBDD-based Algorithms and Proof Systems that Dynamically Change the order of Variables.	J. Symb. Log.	2020	DBLP DOI BibTeX RDF