Results 11 to 20 of about 3,773,797 (206)
Symbolic Magnifying Lens Abstraction in Markov Decision Processes [PDF]
, 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
Using Extended Logical Primitives for Efficient BDD Building
Mathematics, 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
Sensors, 2022 Autonomous vehicles (AV) are a hot topic for safe mobility, which inevitably requires sensors to achieve autonomy, but relying too heavily on sensors will be a risk factor.
Arvind Kumar, Hiroaki Wagatsuma
doaj +1 more source
Influence of Load on Reliability of Storage Area Networks [PDF]
International Journal of Mathematical, Engineering and Management Sciences, 2021 During the coronavirus pandemic, telecommuting is widely required, making remote data access grow significantly. This requires highly reliable data storage solutions. Storage area networks (SANs) are one of such solutions.
Guixiang Lv, Liudong Xing
doaj +1 more source
Compression with wildcards: All exact or all minimal hitting sets
Open Mathematics, 2023 Our objective is the compressed enumeration (based on wildcards) of all minimal hitting sets of general hypergraphs. To the author’s best knowledge, the only previous attempt towards compression, due to Toda, is based on binary decision diagrams and much
Wild Marcel
doaj +1 more source
Approximate BDD Minimization by Weighted A* [PDF]
, 2008 Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synthesis. The size of BDDs depends on a chosen variable ordering, i.e.
Rudiger Ebendt +3 more
core +2 more sources
Informatika, 2023 Objectives. The problem of circuit implementation of incompletely specified (partial) k-valued logic functions given by tabular representations is considered.
P. N. Bibilo
doaj +1 more source
Formal Methods for Exact Analysis of Approximate Circuits
IEEE Access, 2019 Approximate circuits are digital circuits that are intentionally designed in such a way that the specification is violated in terms of functionality in order to obtain some improvements in power consumption, performance or area, in comparison with fully ...
Zdenek Vasicek
doaj +1 more source
IET Computers & Digital Techniques, 2021 Memristors are two‐terminal nano‐electronic devices that make it possible to design non‐volatile memory and logic circuits with high integration density.
Anindita Chakraborty +5 more
doaj +1 more source
Novel Reduction Methods for Decision Diagrams
IEEE Access, 2023 We propose a novel method of reduction for binary-based decision diagrams (DD) exploiting the similarities between Boolean functions. Conventional methods are able to remove redundant parts of DD that adhere to (or represent) identical structures.
Jan Lucansky, Ivan Kotuliak
doaj +1 more source