Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
343
A BDD-Based Approach for Modeling Plant and Supervisor by Extended Finite Automata
- IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY
, 2011
"... In this paper, we settle some problems that are encountered when modeling and synthesizing complex industrial systems by the supervisory control theory. First, modeling such huge systems with explicit state-transition models typically results in an intractable model. An alternative modeling approach ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
, the models are symbolically represented by binary decision diagrams (BDDs). All computations that are performed in this framework are based on BDD operations. The framework has been implemented in a supervisory control tool and applied to industrially relevant benchmark problems.
A BDD-based Approach to Multiple-level Combinational Logic Synthesis
, 1995
"... this paper, we call them BDDs for short. ..."
A BDD-Based Approach for Designing Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems
"... In order to develop a computationally efficient implementation of the maximally permissive deadlock avoidance policy (DAP) for complex resource allocation systems (RAS), a recent approach focuses on the identification of a set of critical states of the underlying RAS state-space, referred to as mini ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
to as minimal boundary unsafe states. The availability of this information en-ables an expedient one-step-lookahead scheme that prevents the RAS from reaching outside its safe region. The work presented in this paper seeks to develop a symbolic approach, based on binary decision diagrams (BDDs), for efficiently
BDD-Based Decision Procedures for the Modal Logic K
- Journal of Applied Non-classical Logics
, 2005
"... We describe BDD-based decision procedures for the modal logic K. Our approach is inspired by the automata-theoretic approach, but we avoid explicit automata construction. Instead, we compute certain fixpoints of a set of types---which can be viewed as an on-the-fly emptiness of the automaton. We use ..."
Abstract
-
Cited by 28 (1 self)
- Add to MetaCart
We describe BDD-based decision procedures for the modal logic K. Our approach is inspired by the automata-theoretic approach, but we avoid explicit automata construction. Instead, we compute certain fixpoints of a set of types---which can be viewed as an on-the-fly emptiness of the automaton. We
Symbolic Model Checking Using SAT Procedures instead of BDDs
- DAC 99
, 1999
"... In this paper, we study the application of propositional decision procedures in hardware verification. In particular, we apply bounded model checking, as introduced in [1], to equivalence and invariant checking. We present several optimizations that reduce the size of generated propositional formula ..."
Abstract
-
Cited by 329 (28 self)
- Add to MetaCart
formulas. In many instances, our SAT-based approach can significantly outperform BDD-based approaches. We observe that SAT-based techniques are particularly efficient in detecting errors in both combinational and sequential designs.
BDD-Based Decision Procedures for K
, 2002
"... We describe BDD-based decision procedures for K. Our approach is inspired by the automata-theoretic approach, but we avoid explicit automata construction. Our algorithms compute the fixpoint of a set of types, which are sets of formulas satisfying some conststency conditions. We use BDDs to represen ..."
Abstract
-
Cited by 24 (5 self)
- Add to MetaCart
We describe BDD-based decision procedures for K. Our approach is inspired by the automata-theoretic approach, but we avoid explicit automata construction. Our algorithms compute the fixpoint of a set of types, which are sets of formulas satisfying some conststency conditions. We use BDDs
Efficient BDD-based Search for Planning
, 2001
"... In this thesis we propose to develop specialized search algorithms and domain encodings based on reduced ordered binary decision diagrams (bdds) for deterministic and non-deterministic planning problems. Bdds are compact representations of Boolean functions that have been successfully applied in ..."
Abstract
- Add to MetaCart
in model checking to implicitly represent and traverse very large state spaces. Recent research has shown that bdd-based search can be one of the most efficient known approaches for optimal deterministic planning and that bdds are very suitable for representing universal plans for non
BDD-Based Decision Procedures for K
"... Abstract. We describe BDD-based decision procedures for K. Our approach isinspired by the automata-theoretic approach, but we avoid explicit automata construction. Our algorithms compute the fixpoint of a set of types, which are sets offormulas satisfying some consistency conditions. We use BDDs to ..."
Abstract
- Add to MetaCart
Abstract. We describe BDD-based decision procedures for K. Our approach isinspired by the automata-theoretic approach, but we avoid explicit automata construction. Our algorithms compute the fixpoint of a set of types, which are sets offormulas satisfying some consistency conditions. We use BDDs
BDD-based synthesis of reversible logic for large functions
- in Design Automation Conf., 2009
"... Reversible logic is the basis for several emerging technologies such as quantum computing, optical computing, or DNA computing and has further applications in domains like low-power design and nan-otechnologies. However, current methods for the synthesis of re-versible logic are limited, i.e. they a ..."
Abstract
-
Cited by 46 (28 self)
- Add to MetaCart
.e. they are applicable to relatively small functions only. In this paper, we propose a synthesis approach, that can cope with Boolean functions containing more than a hundred of variables. We present a technique to derive reversible circuits for a function given by a Binary Decision Diagram (BDD). The cir
BDD-based Logic Synthesis for LUT-based FPGAs
- DESIGN AUTOMATION OF ELECTRONIC SYSTEMS
, 2002
"... ... This paper describes an FPGA-specific logic synthesis approach, which unites multi-level logic transformation, decomposition, and optimization techniques into a single synthesis framework. This system performs network transformation, decomposition and optimization at an early stage to generate a ..."
Abstract
-
Cited by 19 (1 self)
- Add to MetaCart
a network which can be directly mapped onto FPGAs. Our techniques are built upon a BDD-based logic decomposition system. With this system, both AND-OR decompositions and AND-XOR decompositions can be identified, resulting in large area savings for synthesized XOR-intensive circuits. To induce
Results 1 - 10
of
343
