Results 11 to 20 of about 131,761 (282)
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 +8 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 +11 more sources
Beyond Language Equivalence on Visibly Pushdown Automata [PDF]
Logical Methods in Computer Science, 2009 We study (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper
Jiří Srba
doaj +5 more sources
NP-Logic Systems and Model-Equivalence Reductions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 In this paper we investigate the existence of model-equivalence reduction between NP-logic systems which are logic systems with model existence problem in NP.
Yuping Shen, Xishun Zhao
doaj +4 more sources
Deterministic Timed Finite State Machines: Equivalence Checking and Expressive Power [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 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 +8 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
Equivalence checking of quantum finite-state machines [PDF]
Journal of Computer and System Sciences, 2021 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 +5 more sources
Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 One technique to reduce the state-space explosion problem in temporal logic model checking is symmetry reduction. The combination of symmetry reduction and symbolic model checking by using BDDs suffered a long time from the prohibitively large BDD for ...
Christian Appold
doaj +4 more sources
On the Verification of a WiMax Design Using Symbolic Simulation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 In top-down multi-level design methodologies, design descriptions at higher levels of abstraction are incrementally refined to the final realizations. Simulation based techniques have traditionally been used to verify that such model refinements do not ...
Gabriela Nicolescu +4 more
doaj +6 more sources
A Reduced Semantics for Deciding Trace Equivalence [PDF]
Logical Methods in Computer Science, 2017 Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e., without ...
David Baelde +2 more
doaj +5 more sources