Results 21 to 30 of about 6,656 (189)
Fast Validation of Mixed-Signal SoCs
Today’s mixed-signal SoCs are challenging to validate. Running enough test vectors often requires the use of event-driven simulation and hardware emulation, which in turn necessitates the creation of analog behavioral models.
Daniel Stanley +5 more
doaj +1 more source
Equivalence checking of quantum finite-state machines [PDF]
In this paper, we introduce the model of quantum Mealy machines and study the equivalence checking and minimisation problems of them. Two efficient algorithms are developed for checking equivalence of two states in the same machine and for checking equivalence of two machines. As an application, they are used in equivalence checking of quantum circuits.
Wang, Qisheng +2 more
openaire +3 more sources
Finite state automata in the theory of algebraic program schemata
Algebraic models of programs considered in this paper generalize two models of programs introduced by A.A. Lyapunov and A.A. Letichevsky. The theory of these models focuses on the equivalence checking problem for program schemata which are formalization ...
R. I. Podlovchenko
doaj +1 more source
Effective Marking Equivalence Checking in Systems with Dynamic Process Creation [PDF]
The starting point of this work is a framework allowing to model systems with dynamic process creation, equipped with a procedure to detect symmetric executions (ie., which differ only by the identities of processes).
Łukasz Fronc
doaj +1 more source
Deterministic Timed Finite State Machines: Equivalence Checking and Expressive Power [PDF]
There has been a growing interest in defining models of automata enriched with time. For instance, timed automata were introduced as automata extended with clocks. In this paper, we study models of timed finite state machines (TFSMs), i.e., FSMs enriched
Davide Bresolin +3 more
doaj +1 more source
Equivalence checking by logic relaxation [PDF]
We introduce a new framework for Equivalence Checking (EC) of Boolean circuits based on a general technique called Logic Relaxation (LoR). The essence of LoR is to relax the formula to be solved and compute a superset S of the set of new behaviors. Namely, S contains all new satisfying assignments that appeared due to relaxation and does not contain ...
openaire +2 more sources
On the application of equivalence checking algorithms for program minimization
Equivalence checking algorithms found vast applications in system programming; they are used in software refactoring, security checking, malware detection, program integration, regression verification, compiler verification and validation.
V. A. Zakharov, V. V. Podymov
doaj +1 more source
Heuristic search for equivalence checking
Equivalence checking plays a crucial role in formal verification since it is a natural relation for expressing the matching of a system implementation against its specification. In this paper, we present an efficient procedure, based on heuristic search, for checking well-known bisimulation equivalences for concurrent systems specified through process ...
DE FRANCESCO, NICOLETTA +3 more
openaire +1 more source
Qualitative Logics and Equivalences for Probabilistic Systems [PDF]
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized CTL (QRCTL): formulas of this logic can express the fact that certain temporal properties hold ...
Krishnendu Chatterjee +3 more
doaj +1 more source
Toward Reliable Programmable Logic Controller Function Block Diagrams
Programmable logic controllers (PLCs) are widely used in industrial electronic systems. With the augmenting complexity of system, the reliability poses a crucial challenge in safety critical applications.
Jianyong Zhao, Zhe Tao
doaj +1 more source

