Related papers: The compositional construction of Markov processes…
These lecture notes cover basic automata-theoretic concepts and logical formalisms for the modeling and verification of concurrent and distributed systems. Many of these concepts naturally extend the classical automata and logics over…
We study discretizations of polynomial processes using finite state Markov processes satisfying suitable moment matching conditions. The states of these Markov processes together with their transition probabilities can be interpreted as…
We show that if a product system comes from a quantum Markov semigroup, then it carries a natural Borel structure with respect to which the semigroup may be realized in terms of a measurable representation. We show, too, that the dual…
A model of a discrete pregeometry on a microscopic scale is introduced. This model is a finite network of finite elementary processes. The mathematical description is a d-graph that is a generalization of a graph. This is the particular…
While automata theory often concerns itself with regular predicates, relations corresponding to acceptance by a finite state automaton, in this article we study the regular functions, such relations which are also functions in the…
This paper studies function approximation for finite horizon discrete time Markov decision processes under certain convexity assumptions. Uniform convergence of these approximations on compact sets is proved under several sampling schemes…
We present a formalism to describe slowly decaying systems in the context of finite Markov chains obeying detailed balance. We show that phase space can be partitioned into approximately decoupled regions, in which one may introduce…
Even simply-defined, finite-state generators produce stochastic processes that require tracking an uncountable infinity of probabilistic features for optimal prediction. For processes generated by hidden Markov chains the consequences are…
We consider an $n$-tuple of independent ergodic Markov processes, each of which converges (in the sense of separation distance) at an exponential rate, and obtain a necessary and sufficient condition for the $n$-tuple to exhibit a…
In this paper we attempt to explicate Salmon's idea of a causal process, as defined in terms of the mark method, in the context of C*-dynamical systems. We prove two propositions, one establishing mark manifestation infinitely many times…
We re-address the problem of construction of new infinite-dimensional completely integrable systems on the basis of known ones, and we reveal a working mechanism for such transitions. By splitting the problem's solution in two steps, we…
This paper contributes to the mathematical foundations of logic programming by introducing and studying the sequential composition of answer set programs. On the semantic side, we show that the immediate consequence operator of a program…
This paper provides a general and abstract approach to approximate ergodic regimes of Markov and Feller processes. More precisely, we show that the recursive algorithm presented in Lamberton & Pages (2002) and based on simulation algorithms…
The purpose of this article is a set-indexed extension of the well-known Ornstein-Uhlenbeck process. The first part is devoted to a stationary definition of the random field and ends up with the proof of a complete characterization by its…
We consider a sequence of additive functionals {\phi_n}, set on a sequence of Markov chains {X_n} that weakly converges to a Markov process X. We give sufficient condition for such a sequence to converge in distribution, formulated in terms…
We consider a perturbed system $(X,\varphi(\epsilon,\cdot))$, where $X$ is a topological Markov shift with a countably infinite state space, and $\varphi(\epsilon,\cdot)$ is a real-valued potential on X depending on a small parameter…
In this article is introduced and studied a set-indexed Markov property named C-Markov. This new definition fulfils one important expectation for a Markov property: there exists a natural set-indexed generalization of the concept of…
In this paper we develop the theory of {\it polymorphisms} of measure spaces, which is a generalization of the theory of measure-preserving transformations; we describe the main notions and discuss relations to the theory of Markov…
We construct a family of genealogy-valued Markov processes that are induced by a continuous-time Markov population process. We derive exact expressions for the likelihood of a given genealogy conditional on the history of the underlying…
We elaborate the idea behind Markov chain Monte Carlo (MCMC) methods in a mathematically coherent, yet simple and understandable way. To this end, we proof a pivotal convergence theorem for finite Markov chains and a minimal version of the…