Results 71 to 80 of about 3,622,400 (195)
Mining simple and complex patterns efficiently using Binary Decision Diagrams [PDF]
, 2009 © 2009 Dr. Elsa LoekitoPattern mining is a knowledge discovery task which is useful for finding interesting data characteristics. Existing mining techniques sometimes suffer from limited performance in challenging situations, such as when finding ...
Loekito, E.
core +1 more source
On the error resilience of ordered binary decision diagrams
Theoretical Computer Science, 2015 Ordered Binary Decision Diagrams (OBDDs) are a data structure that is used in an increasing number of fields of Computer Science (e.g., logic synthesis, program verification, data mining, bioinformatics, and data protection) for representing and manipulating discrete structures and Boolean functions.
Anna Bernasconi 0001 +2 more
openaire +4 more sources
Truth tables to binary decision diagrams [PDF]
, 2020 Model transformation tools have reached a considerable level of maturity in the core features, and are currently developing in many directions. Some tools are focusing on providing higher performance for large models or complex transformations. Others focus on bidirectionality, visualisation, traceability, or verifiability, among other research ...
Antonio García-Domínguez, Georg Hinkel
openaire +1 more source
Query Learning Algorithm for Ordered Multi-Terminal Binary Decision Diagrams
, 2023 We propose a query learning algorithm for ordered multi-terminal binary decision diagrams (OMTBDDs) using at most n equivalence and 2n(l\lcei\log_2 m\rceil+ 3n) membership queries by extending the algorithm for ordered binary decision diagrams (OBDDs ...
Nakamura, Atsuyoshi
core
Binary-Decision-Diagrams for Set Abstraction
CoRR, 2015 Whether explicit or implicit, sets are a critical part of many pieces of software. As a result, it is necessary to develop abstractions of sets for the purposes of abstract interpretation, model checking, and deductive verification. However, the construction of effective abstractions for sets is challenging because they are a higher-order construct. It
openaire +3 more sources
, 2008 Decision diagrams are a natural representation of finite functions. The obvious complexity measures are length and size which correspond to time and space of computations.
Ingo Wegener +3 more
core
Factored Edge-Valued Binary Decision Diagrams
, 1997 Factored Edge-Valued Binary Decision Diagrams form an extension to Edge-Valued Binary Decision Diagrams. By associating both an additive and a multiplicative weight with the edges, FEVBDDs can be used to represent a wider range of functions concisely. As
Paul Tafertshofer, Massoud Pedram
core +1 more source
Binary Decision Diagrams as a HOL derived rule [PDF]
The Computer Journal, 1994 Binary Decision Diagrams (BDDs) are a representation for Boolean formulas which makes many operations, in particular tautology - checking, surprisingly efficient in important practical cases. In contrast to such custom decision procedures, the HOL theorem prover expands all proofs out to a sequence of extremely simple primitive inferences.
openaire +2 more sources
Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults
, 2014 This paper discusses the error resilience of Zero-Suppressed Binary Decision Diagrams (ZDDs), which are a particular family of Ordered Binary Decision Diagrams used for representing and manipulating combination sets.
V. Ciriani +6 more
core +1 more source
IET Control Theory & ApplicationsThis work proposes a symbolic method to verify and enforce the current‐state opacity of labelled Petri nets (LPNs). The notion of basis markings of partially observed Petri nets currently dominates the development of opacity verification and enforcement ...
Kun Peng, Yufeng Chen, Zhiwu Li
doaj +1 more source