相关论文: Reversible Truly Concurrent Process Algebra

For n an even number of qubits and v a unitary evolution, a matrix decomposition v=k1 a k2 of the unitary group is explicitly computable and allows for study of the dynamics of the concurrence entanglement monotone. The side factors k1 and…

In this paper, we consider a Banach space valued random coefficient autoregressive process. Our studies on this process involve existence, weak law of large numbers, strong law of large numbers, some exponential inequalities, central limit…

Statistical inference for non-stationary data is hindered by the failure of classical central limit theorems (CLTs), not least because there is no fixed Gaussian limit to converge to. To resolve this, we introduce relative weak convergence,…

We introduce deterministic concurrent systems as a subclass of concurrent systems. Deterministic concurrent system are "locally commutative" concurrent systems. We prove that irreducible and deterministic concurrent systems have a unique…

An extremely common bottleneck encountered in statistical learning algorithms is inversion of huge covariance matrices, examples being in evaluating Gaussian likelihoods for a large number of data points. We propose general parallel…

A construction of reversible extensions of dynamical systems which applies to arbitrary mappings (not necessarily with open range) is presented. It is based on calculating the maximal ideal space of C*-algebras that extends endomorphisms to…

For insight into the parallel composition for true concurrency, we recall the axiomatization of the parallel composition modulo truly concurrent behavioral equivalences as the sidelights of truly concurrent process algebra APTC. We prove…

Reversible logic synthesis is a crucial component in quantum electronic design automation. While rule-based methodologies have gained prominence in reversible circuit optimization, the completeness of the transformation rule systems is a…

The Software Transactional Memory (STM) model is an original approach for controlling concurrent accesses to ressources without the need for explicit lock-based synchronization mechanisms. A key feature of STM is to provide a way to group…

We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…

Reinforcement learning (RL) presents a promising framework to learn policies through environment interaction, but often requires an infeasible amount of interaction data to solve complex tasks from sparse rewards. One direction includes…

A standard contextual equivalence for process algebras is strong barbed congruence. Configuration structures are a denotational semantics for processes in which one can define equivalences that are more discriminating, i.e. that distinguish…

The inherent irreversibility of quantum dynamics for open systems poses a significant barrier to the inversion of unknown quantum processes. To tackle this challenge, we propose the framework of virtual combs that exploit the unknown…

Reversible logic has two main properties. First, the number of inputs is equal to the number of outputs. Second, it implements a one-to-one mapping; i.e., one can reconstruct the inputs from the outputs. These properties enable its…

We revisit completion modulo equational theories for left-linear term rewrite systems where unification modulo the theory is avoided and the normal rewrite relation can be used in order to decide validity questions. To that end, we give a…

Globular CW-complexes and flows are both geometric models of concurrent processes which allow to model in a precise way the notion of dihomotopy. Dihomotopy is an equivalence relation which preserves computer-scientific properties like the…

Properties of Term Rewriting Systems are called modular iff they are preserved under (and reflected by) disjoint union, i.e. when combining two Term Rewriting Systems with disjoint signatures. Convergence is the property of Infinitary Term…

Reversible computing is a new paradigm that has emerged recently and extends the traditional forwards-only computing mode with the ability to execute in backwards, so that computation can run in reverse as easily as in forward. Two…

An approach has been devised and tested for preserving the molecular geometry and taking into account energetic considerations during Reverse Monte Carlo modeling. Instead of the commonly used fixed neighbour constraints, where molecules…

TC++ is a free/libre open-source software of the transcorrelated (TC) method for first-principles calculation of solids. Here, the TC method is one of the promising wave-function theories that can be applied to periodic systems with…