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

We construct a weak KAM theory for parameterized cobordisms and their relaxation, holonomic measures. We find a weak kam solution in that context, and we show that in many cases it corresponds to an exact form that satisfies a version of…

We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous unboundedness problem, is decidable. From recent work by Zetzsche this means that we can construct the downward closure of the set of words…

Automata-logic connections are pillars of the theory of regular languages. Such connections are harder to obtain for transducers, but important results have been obtained recently for word-to-word transformations, showing that the three…

Automata over infinite alphabets have recently come to be studied extensively as potentially useful tools for solving problems in verification and database theory. One popular model of automata studied is the Class Memory Automata (CMA),…

(English) This monograph aims at presenting the core weak convergence theory for sequences of random vectors with values in $\mathbb{R}^k$. In some places, a more general formulation in metric spaces is provided. It lays out the necessary…

Weighted labelled transition systems are LTSs whose transitions are given weights drawn from a commutative monoid. WLTSs subsume a wide range of LTSs, providing a general notion of strong (weighted) bisimulation. In this paper we extend…

Weak gravitational lensing on a cosmological scales can provide strong constraints both on the nature of dark matter and the dark energy equation of state. Most current weak lensing studies are restricted to (two-dimensional) projections,…

This article investigates weak convergence of the sequential $d$-dimensional empirical process under strong mixing. Weak convergence is established for mixing rates $\alpha_n = O(n^{-a})$, where $a>1$, which slightly improves upon existing…

Weighted automata (WA) are an important formalism to describe quantitative properties. Obtaining equivalent deterministic machines is a longstanding research problem. In this paper we consider WA with a set semantics, meaning that the…

This paper explores the well known approximation approach to decide weak bisimilarity of Basic Parallel Processes. We look into how different refinement functions can be used to prove weak bisimilarity decidable for certain subclasses. We…

We have recently defined a weak Markovian bisimulation equivalence in an integrated-time setting, which reduces sequences of exponentially timed internal actions to individual exponentially timed internal actions having the same average…

The usual way of defining weak equivalences for simplicial presheaves is to require an isomorphism on all sheaves of homotopy groups. We unravel some of the machinery here, and give a more concrete description in terms of local homotopy…

In this paper, we formulate a notion of diagnosability for labeled weighted automata over a class of dioids which admit both positive and negative numbers as well as vectors. The weights can represent diverse physical meanings such as time…

The homological scaffold leverages persistent homology to construct a topologically sound summary of a weighted network. However, its crucial dependency on the choice of representative cycles hinders the ability to trace back global…

We introduce a notion of weak convergence in arbitrary metric spaces. Metric functionals are key in our analysis: weak convergence of sequences in a given metric space is tested against all the metric functionals defined on said space. When…

We establish a consistency result by comparing two independent notions of generalised solutions to a large class of linear hyperbolic first order PDE systems with constant coefficients, showing that they eventually coincide. The first is…

CCS can be considered as a most natural extension of finite state automata in which interaction is made possible thanks to parallel composition. We propose here a similar extension for top-down tree automata. We introduce a parallel…

We introduce a general categorical framework for the definition of weak behavioural equivalences, building on and extending recent results in the field. This framework is based on parametrized saturation categories, i.e. categories whose…

Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell…

Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivalences between specific programs. For this purpose, one adds…