Related papers: Late Weak Bisimulation for Markov Automata

It is well known that the theory of coalgebras provides an abstract definition of behavioural equivalence that coincides with strong bisimulation across a wide variety of state-based systems. Unfortunately, the theory in the presence of…

We present a notion of bisimulation that induces a reduced network which is semantically equivalent to the given neural network. We provide a minimization algorithm to construct the smallest bisimulation equivalent network. Reductions that…

Collocated adaptive control of underactuated systems is still a main concern for the control community, all the more so because the collocated dynamics is no longer linear with respect to the constant base parameters. This work extends and…

Planar automata seems to be representative of the synchronizing behavior of deterministic finite state automata. We conjecture that \v{C}erny's conjecture holds true, if and only if, it holds true for planar automata. In this paper we have…

We propose a generalisation of concurrent Kleene algebra \cite{Hoa09} that can take account of probabilistic effects in the presence of concurrency. The algebra is proved sound with respect to a model of automata modulo a variant of rooted…

This paper provides convergence analysis for the approximation of a class of path-dependent functionals underlying a continuous stochastic process. In the first part, given a sequence of weak convergent processes, we provide a sufficient…

The article contains a survey of our results on weakly commensurable arithmetic and general Zariski-dense subgroups, length-commensurable and isospectral locally symmetric spaces and of related problems in the theory of semi-simple agebraic…

Motivated by applications in databases, this paper considers various fragments of the calculus of binary relations. The fragments are obtained by leaving out, or keeping in, some of the standard operators, along with some derived operators…

Recently, alternating transition systems are adopted to describe control systems with disturbances and their finite abstract systems. In order to capture the equivalence relation between these systems, a notion of alternating approximate…

We prove a complete class theorem that characterizes \emph{all} stationary time reversible Markov processes whose finite dimensional marginal distributions (of all orders) are infinitely divisible. Aside from two degenerate cases (iid and…

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 introduce a new class of probabilistic cellular automata that are capable of exhibiting rich dynamics such as synchronization and ergodicity and can be easily inferred from data. The system is a finite-state locally interacting Markov…

This paper discusses the existence of a sufficient condition for an operator to be weakly hypercyclic. We establish a weak hypercyclicity criterion, and thereupon we can answer questions 5.3 and 5.8 posed by Chan and Sanders in 2004.…

In this short note, we consider posterior simulation for a linear regression model when the error distribution is given by a scale mixture of multivariate normals. We first show that the sampler of Backlund and Hobert (2020) for the case of…

We consider generalized definitions of mixing and exactness for random dynamical systems in terms of Markov operator cocycles. We first give six fundamental definitions of mixing for Markov operator cocycles in view of observations of the…

Mechanistic interpretability aims to break models into meaningful parts; verifying that two such parts implement the same computation is a prerequisite. Existing similarity measures evaluate either empirical behaviour, leaving them blind to…

The masses of data now available have opened up the prospect of discovering weak signals using machine-learning algorithms, with a view to predictive or interpretation tasks. As this survey of recent results attempts to show, bringing…

In this paper we introduce the class of weak Heyting Brouwer algebras (WHB-algebras, for short). We extend the well known duality between distributive lattices and Priestley spaces, in order to exhibit a relational Priestley-like duality…

Systems of interacting continuous-time Markov chains are a powerful model class, but inference is typically intractable in high dimensional settings. Auxiliary information, such as noisy observations, is typically only available at discrete…

Establishing equivalences between programs or systems is crucial both for verifying correctness of programs, by establishing that two implementations are equivalent, and for justifying optimisations and program transformations, by…