相关论文: Weak equivalence of higher-dimensional automata

Finite automata whose computations can be reversed, at any point, by knowing the last k symbols read from the input, for a fixed k, are considered. These devices and their accepted languages are called k-reversible automata and k-reversible…

Deciding in an efficient way weak probabilistic bisimulation in the context of Probabilistic Automata is an open problem for about a decade. In this work we close this problem by proposing a procedure that checks in polynomial time the…

We show in this work that homology in degree d of a congruence group, in a very general framework, defines a weakly polynomial functor of degree at most 2d and we describe this functor modulo polynomial functors of smaller degree. Our main…

We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…

Weak values are usually associated with weak measurements of an observable on a pre- and post-selected ensemble. We show that more generally, weak values are proportional to the correlation between two pointers in a successive measurement.…

We consider a recent formulation of weak KAM theory proposed by Evans. As well as for classical integrability, for one dimensional mechanical Hamiltonian systems all the computations can be explicitly done. This allows us on the one hand to…

Weak measurements are a new tool for characterizing post-selected quantum systems during their evolution. Weak measurement was originally formulated in terms of von Neumann interactions which are practically available for only the simplest…

The weak equivalence principle is studied in a space with noncommutativity of coordinates and noncommutativity of momenta. We find conditions on the parameters of noncommutativity which give the possibility to recover the equivalence…

Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for these automata is decidable. This result implies new decidability results for…

We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length $\varTheta(n^2)$, where…

We present a new language semantics for real-time concurrency. Its operational models are higher-dimensional timed automata (HDTAs), a generalization of both higher-dimensional automata and timed automata. In real-time concurrent systems,…

Classically, there are two model category structures on coalgebras in the category of chain complexes over a field. In one, the weak equivalences are maps which induce an isomorphism on homology. In the other, the weak equivalences are maps…

We investigate the extent to which the weak equivalences in a model category can be equipped with algebraic structure. We prove, for instance, that there exists a monad T such that a morphism of topological spaces admits T-algebra structure…

Computationally-efficient semilocal approximations of density functional theory at the level of the local spin density approximation (LSDA) or generalized gradient approximation (GGA) poorly describe weak interactions. We show improved…

We introduce a new category of higher-dimensional automata in which the morphisms are functional homotopy simulations, i.e. functional simulations up to concurrency of independent events. For this, we use unfoldings of higher-dimensional…

We introduce heap automata, a formalism for automatic reasoning about robustness properties of the symbolic heap fragment of separation logic with user-defined inductive predicates. Robustness properties, such as satisfiability,…

We present a recent proposal of a simple prescription for including low-energy weak-interactions into the framework of holographic QCD, based on the standard AdS/CFT dictionary of double-trace deformations. This opens a new perspective on…

Let (X,dX) and (Y,dY) be semimetric spaces with distance sets D(X) and, respectively, D(Y). A mapping F : X \to Y is a weak similarity if it is surjective and there exists a strictly increasing f : D(Y) \to D(X) such that dX = f \circ dY…

Automata admitting at most one accepting run per structure, known as unambiguous automata, find applications in verification of reactive systems as they extend the class of deterministic automata whilst maintaining some of their desirable…

Weak structures abound in higher category theory, but are often suitably equivalent to stricter structures that are easier to understand. We extend strictification for tricategories and trihomomorphisms to trinatural transformations,…