Results 21 to 30 of about 3,622,400 (195)

Reversible Logic Synthesis Using Binary Decision Diagrams With Exploiting Efficient Reordering Operators

open access: yesIEEE Access, 2020
With the continuous shrinkage of transistor sizes in very large scale integrated circuits, power consumption forms a serious concern to be tackled. With their ability to allow for zero energy dissipation, reversible circuits have been considered as ...
Baker K. Abdalhaq   +2 more
doaj   +1 more source

AbsSynthe: abstract synthesis from succinct safety specifications [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2014
In this paper, we describe a synthesis algorithm for safety specifications described as circuits. Our algorithm is based on fixpoint computations, abstraction and refinement, it uses binary decision diagrams as symbolic data structure.
Romain Brenguier   +3 more
doaj   +1 more source

Symbolic Magnifying Lens Abstraction in Markov Decision Processes [PDF]

open access: yes, 2008
In this paper, we combine abstraction-refinement and symbolic techniques to fight the state-space explosion problem when model checking Markov decision processes (MDPs).
Luca de Alfaro   +7 more
core   +1 more source

Developing a Decision Analytic Framework Based on Influence Diagrams in Relation to Mass Evacuations [PDF]

open access: yes, 2013
Presented at International Conference on Emergency Preparedness "The Challenges of Mass Evacuation" 21st - 23rd September 2010 Aston Business SchoolIn this paper, we examine the role which decision analysis can play in a situation requiring a mass ...
McNaught, Ken R., Zagorecki, A.
core   +7 more sources

Synthesis of quantum circuits based on incompletely specified functions and if-decision diagrams

open access: yesЖурнал Белорусского государственного университета: Математика, информатика, 2021
The problem of synthesis and optimisation of logical reversible and quantum circuits from functional descriptions represented as decision diagrams is considered.
Anatoly A. Prihozhy
doaj   +1 more source

Synthesis of parallel adders from if-decision diagrams

open access: yesСистемный анализ и прикладная информатика, 2020
Addition is one of the timing critical operations in most of modern processing units. For decades, extensive research has been done devoted to designing higher speed and less complex adder architectures, and to developing advanced adder implementation ...
A. A. Prihozhy
doaj   +1 more source

Symbolic BDD and ADD Algorithms for Energy Games [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2016
Energy games, which model quantitative consumption of a limited resource, e.g., time or energy, play a central role in quantitative models for reactive systems.
Shahar Maoz   +2 more
doaj   +1 more source

Binary Decision Diagrams by Shared Rewriting [PDF]

open access: yes, 2000
In this paper we propose a uniform description of basic BDD theory and algorithms by means of term rewriting. Since a BDD is a DAG instead of a tree we need a notion of shared rewriting and develop appropriate theory. A rewriting system is presented by which canonical forms can be obtained. Various reduction strategies give rise to different algorithms.
Pol, J. van de, Zantema, H.
openaire   +5 more sources

Using Extended Logical Primitives for Efficient BDD Building

open access: yesMathematics, 2020
Binary Decision Diagrams (BDDs) have been used to represent logic models in a variety of research contexts, such as software product lines, circuit testing, and plasma confinement, among others.
David Fernandez-Amoros   +3 more
doaj   +1 more source

Reasoning with ordered binary decision diagrams

open access: yesDiscrete Applied Mathematics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Takashi Horiyama, Toshihide Ibaraki
openaire   +2 more sources

Home - About - Disclaimer - Privacy