English
Related papers

Related papers: Logical, Metric, and Algorithmic Characterisations…

200 papers

We analyze the procedure of lifting in classical stochastic and quantum systems. It enables one to `lift' a state of a system into a state of `system+reservoir'. This procedure is important both in quantum information theory and the theory…

Quantum Physics · Physics 2011-02-02 L. Accardi , D. Chruściński , A. Kossakowski , T. Matsuoka , M. Ohya

Probability maps are additive and normalised maps taking values in the unit interval of a lattice ordered Abelian group. They appear in theory of affine representations and they are also a semantic counterpart of Hajek's probability logic.…

Functional Analysis · Mathematics 2018-12-07 T. Kroupa

We show that all non-relativistic quantum processes, whether open or closed, are either unitary or probabilistic unitary, i.e., probabilistic combination of unitary evolutions. This means that for open quantum systems, its continuous…

Quantum Physics · Physics 2024-12-16 Le Hu , Andrew N. Jordan

Probabilistic behavior is omnipresent in computer controlled systems, in particular, so-called safety-critical hybrid systems, because of various reasons, like uncertain environments, or fundamental properties of nature. In this paper, we…

Formal Languages and Automata Theory · Computer Science 2021-01-04 Fujun Wang , Zining Cao , Lixing Tan , Zhen Li

Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilistic automata. However, decision algorithms for strong and weak…

Logic in Computer Science · Computer Science 2015-07-01 Lijun Zhang , Holger Hermanns , Friedrich Eisenbrand , David N. Jansen

First-order probabilistic models combine representational power of first-order logic with graphical models. There is an ongoing effort to design lifted inference algorithms for first-order probabilistic models. We analyze lifted inference…

Artificial Intelligence · Computer Science 2012-05-14 Jacek Kisynski , David L Poole

Probabilistic couplings are the foundation for many probabilistic relational program logics and arise when relating random sampling statements across two programs. In relational program logics, this manifests as dedicated coupling rules…

Logic in Computer Science · Computer Science 2023-11-15 Simon Oddershede Gregersen , Alejandro Aguirre , Philipp G. Haselwarter , Joseph Tassarotti , Lars Birkedal

The problem of finding a finite state symbolic model which is bisimilar to a hybrid dynamical system (HDS) and has the minimum number of states is considered. The considered class of HDS allows for discrete-valued inputs that only affect…

Systems and Control · Computer Science 2014-09-02 Babak Tavassoli

This paper presents a novel technique for state space reduction of probabilistic specifications, based on a newly developed notion of confluence for probabilistic automata. We prove that this reduction preserves branching probabilistic…

Logic in Computer Science · Computer Science 2010-11-11 Mark Timmer , Mariëlle Stoelinga , Jaco van de Pol

We define a notion of Lambda-simulation for coalgebraic modal logics, parametric on the choice Lambda of predicate liftings for a functor T. We show this notion is adequate in several ways: i) it preserves truth of positive formulas, ii)…

Logic in Computer Science · Computer Science 2013-04-12 Daniel Gorín , Lutz Schröder

The main aim of this study is to introduce statistical approximation properties of (p; q)-Szasz Mirakjan Kantorovich operators with the help of the Korovkin type statistical approximation theorem. Rates of statistical convergence by means…

Classical Analysis and ODEs · Mathematics 2016-04-19 Bhausaheb R. Sontakke , Amjad Shaikh

The mathematical formalism of Quantum Mechanics is derived or "reconstructed" from more basic considerations of probability theory and information geometry. The starting point is the recognition that probabilities are central to QM: the…

Quantum Physics · Physics 2021-09-14 Ariel Caticha

In this paper, we introduce a Kantorovich version of the Bernstein-type logarithmic operators. The idea comes from the wide literature concerning exponential polynomials that preserve exponential functions: here, the exponential weights are…

Functional Analysis · Mathematics 2026-02-12 Laura Angeloni , Danilo Costarelli , Chiara Darielli

This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the…

Logic in Computer Science · Computer Science 2017-01-11 Luca Aceto , Wan Fokkink , Anna Ingolfsdottir , Bas Luttik

Probabilistic hyperproperties describe probabilistic relations between multiple sets of executions in a stochastic system. Prominent examples include information-theoretic characterizations of security and privacy policies. However, model…

Logic in Computer Science · Computer Science 2026-04-09 Lina Gerlach , Tobias Winkler , Erika Ábrahám , Borzoo Bonakdarpour , Sebastian Junges

Probabilistic Inference Modulo Theories (PIMT) is a recent framework that expands exact inference on graphical models to use richer languages that include arithmetic, equalities, and inequalities on both integers and real numbers. In this…

Artificial Intelligence · Computer Science 2017-09-06 Rodrigo de Salvo Braz , Ciaran O'Reilly

We study how the lift-and-project procedure applies to the multiparametric analysis of conic linear optimization (CLO) problems. We first introduce the concept of a pair of primal and dual conic representable sets and define the set-valued…

Optimization and Control · Mathematics 2022-12-09 Zi-zong Yan , Xiangjun Li , Jinhai Guo

We continue the study of the correlation functions for the point stochastic processes introduced in Part I (G.Olshanski, math.RT/9804086). We find an integral representation of all the correlation functions and their explicit expression in…

Representation Theory · Mathematics 2007-05-23 Alexei Borodin

The majorization relation has been shown to be useful in classifying which transformations of jointly held quantum states are possible using local operations and classical communication. In some cases, a direct transformation between two…

Quantum Physics · Physics 2013-05-29 Sumit Daftuar , Matthew Klimesh

The classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In this paper we study this type of result in a general…

Logic in Computer Science · Computer Science 2023-06-22 Clemens Kupke , Jurriaan Rot