Results 1 to 10 of about 6,613 (146)
Model-Checking Process Equivalences [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Process equivalences are formal methods that relate programs and system which, informally, behave in the same way. Since there is no unique notion of what it means for two dynamic systems to display the same behaviour there are a multitude of formal ...
Martin Lange +2 more
doaj +6 more sources
Equivalence checking for weak bi-Kleene algebra [PDF]
Logical Methods in Computer Science, 2021 Pomset automata are an operational model of weak bi-Kleene algebra, which describes programs that can fork an execution into parallel threads, upon completion of which execution can join to resume as a single thread.
Tobias Kappé +4 more
doaj +7 more sources
Contraction Heuristics for Tensor Decision Diagrams [PDF]
EntropyIn this paper, we study the equivalence problem for quantum circuits: Given two quantum circuits, are they equivalent? We reduce this problem to the contraction problem of a tensor network.
Christian Bøgh Larsen +3 more
doaj +2 more sources
Strong Equivalence for LPMLN Programs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 LPMLN is a probabilistic extension of answer set programs with the weight scheme adapted from Markov Logic. We study the concept of strong equivalence in LPMLN, which is a useful mathematical tool for simplifying a part of an LPMLN program without ...
Joohyung Lee, Man Luo
doaj +1 more source
Complexity, 2021 Checking the equivalence of two Boolean functions, or combinational circuits modeled as Boolean functions, is often desired when reliable and correct hardware components are required.
Wilayat Khan +3 more
doaj +1 more source
Equivalence checking of quantum circuits by nonlocality
npj Quantum Information, 2022 Suppose two quantum circuit chips are located at different places, for which we do not have any prior knowledge, and cannot see the internal structures either.
Weixiao Sun, Zhaohui Wei
doaj +1 more source
A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction [PDF]
Logical Methods in Computer Science, 2021 One of the most popular state-space reduction techniques for model checking is partial-order reduction (POR). Of the many different POR implementations, stubborn sets are a very versatile variant and have thus seen many different applications over the ...
Thomas Neele +2 more
doaj +1 more source
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
Моделирование и анализ информационных систем, 2020 Finite transducers, two-tape automata, and biautomata are related computational models descended from the concept of Finite-State Automaton. In these models an automaton controls two heads that read or write symbols on the tapes in the one-way mode.
Vladimir A. Zakharov
doaj +1 more source
Improvements to combinational equivalence checking [PDF]
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design - ICCAD '06, 2006 The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulation and BDD/SAT sweeping on the input side (i.e. proving equivalence of some internal nodes in a topological order), interleaved with attempts to run SAT on the output (i.e ...
Alan Mishchenko +3 more
openaire +1 more source
Equivalence Checking Using Trace Partitioning [PDF]
2015 IEEE Computer Society Annual Symposium on VLSI, 2015 One application of equivalence checking is to establish correspondence between a high-level, abstract design and a low-level implementation. We propose a new partitioning technique for the case in which the two designs are substantially different and traditional equivalence-point insertion fails.
Rajdeep Mukherjee +3 more
openaire +1 more source