Related papers: On system rollback and totalised fields
A fast convergence in a fixed-time of solutions of nonlinear dynamical systems, for which special requirements are satisfied on the derivative of a quadratic function calculated along the solutions of the system, is proposed. The conditions…
Guarded recursion is a framework allowing for a formalisation of streams in classical programming languages. The latter take their semantics in cartesian closed categories. However, some programming paradigms do not take their semantics in…
The defining conditions for the irreducible tensor operators associated with the unitary irreducible corepresentions of compact quantum group algebras are deduced first in both the right and left regular coaction formalisms. In each case it…
This paper is devoted to the inverse generator problem in the setting of generators of integrated resolvent operator functions. It is shown that if the operator $A$ is the generator of a tempered $\beta$-times integrated $\alpha$-resolvent…
We give a categorical description of the treatment of the !() exponential in the Geometry of Interaction system, with particular emphasis on the fact that the GoI interpretation 'forgets types'. We demonstrate that it may be thought of as a…
In difference algebra, summability arises as a basic problem upon which rests the effective solution of other more elaborate problems, such as creative telescoping problems and the computation of Galois groups of difference equations. In…
Petri nets are a mathematical language for modeling and reasoning about distributed systems. In this paper we propose an approach to Petri nets for embedding reversibility, i.e., the ability of reversing an executed sequence of operations…
Given an automorphism and an anti-automorphism of a semigroup of a Geometric Algebra, then for each element of the semigroup a (generalized) projection operator exists that is defined on the entire Geometric Algebra. A single fundamental…
In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanations for a series of observations with the same domain. The…
We study safety verification for multithreaded programs with recursive parallelism (i.e. unbounded thread creation and recursion) as well as unbounded integer variables. Since the threads in each program configuration are structured in a…
Inverse problems consist of recovering a signal from a collection of noisy measurements. These problems can often be cast as feasibility problems; however, additional regularization is typically necessary to ensure accurate and stable…
We present a new approach to proving non-termination of non-deterministic integer programs. Our technique is rather simple but efficient. It relies on a purely syntactic reversal of the program's transition system followed by a…
Recursive calls over recursive data are useful for generating probability distributions, and probabilistic programming allows computations over these distributions to be expressed in a modular and intuitive way. Exact inference is also…
Reversible computing is a computational paradigm in which computations are deterministic in both the forward and backward direction, so that programs have well-defined forward and backward semantics. We investigate the formal semantics of…
An algorithm is described for the construction of actions for scalar, spinor, and vector gauge fields that remains well-defined when the metric is degenerate and that involve no contravariant tensor fields. These actions produce the…
It is well-understood that the robustness of mechanical and robotic control systems depends critically on minimizing sensitivity to arbitrary application-specific details whenever possible. For example, if a system is defined and performs…
A class of exact infinitesimal renormalization group transformations is proposed and studied. These transformations are pure changes of variables (i.e., no integration or elimination of some degrees of freedom is required) such that a…
We consider the problem of removing the divergences in an arbitrary gauge-field theory (possibly nonrenormalizable). We show that this can be achieved by performing, order by order in the loop expansion, a redefinition of some parameters…
The problem of prediction consists in forecasting the conditional distribution of the next outcome given the past. Assume that the source generating the data is such that there is a stationary ergodic predictor whose error converges to zero…
We study the fixed point problem for a system of multivariate operators that are coordinate-wise monotone (i.e., nondecreasing or nonincreasing in each of the variables, independently), in the setting of quasi-ordered sets. We show that…