English
Related papers

Related papers: Modal Characterisations of Behavioural Pseudometri…

200 papers

Based on a recent proof of free choices in linking equations to the experiments they describe, I clarify relations among some purely mathematical entities featured in quantum mechanics (probabilities, density operators, partial traces, and…

Quantum Physics · Physics 2014-09-15 John M. Myers

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

Probabilistic transition system specifications (PTSSs) in the $nt \mu f\theta / nt\mu x\theta$ format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and…

Logic in Computer Science · Computer Science 2015-08-28 Pedro R. D'Argenio , Matias David Lee , Daniel Gebler

In this paper we study the equivalence of nondeterministic automata pairing the concept of a bisimulation with the recently introduced concept of a uniform relation. In this symbiosis, uniform relations serve as equivalence relations which…

Formal Languages and Automata Theory · Computer Science 2011-03-01 Miroslav Ćirić , Jelena Ignjatović , Milan Bašić , Ivana Jančić

We discuss two parameterizations of models for marginal independencies for discrete distributions which are representable by bi-directed graph models, under the global Markov property. Such models are useful data analytic tools especially…

Machine Learning · Statistics 2008-01-10 Monia Lupparelli , Giovanni M. Marchetti , Wicher P. Bergsma

Non-additive uncertainty theories, typically possibility theory, belief functions and imprecise probabilities share a common feature with modal logic: the duality properties between possibility and necessity measures, belief and…

Artificial Intelligence · Computer Science 2023-03-24 Didier Dubois , Lluis Godo , Henri Prade

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…

Logic in Computer Science · Computer Science 2012-12-21 Jinjin Zhang , Zhaohui Zhu

Inquisitive modal logic InqML is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they…

Logic · Mathematics 2023-06-22 Ivano Ciardelli , Martin Otto

General frameworks have been recently proposed as unifying theories for processes combining non-determinism with quantitative aspects (such as probabilistic or stochastically timed executions), aiming to provide general results and tools.…

Logic in Computer Science · Computer Science 2015-07-01 Marino Miculan , Marco Peressotti

Bisimulation is a concept that captures behavioural equivalence. It has been studied extensively on nonprobabilistic systems and on discrete-time Markov processes and on so-called continuous-time Markov chains. In the latter time is…

Logic in Computer Science · Computer Science 2024-01-31 Linan Chen , Florence Clerc , Prakash Panangaden

We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale's linear bisimulation relation. Our metrics are induced by seminorms on the state space of WFA. Our development is based on spectral…

Formal Languages and Automata Theory · Computer Science 2017-05-16 Borja Balle , Pascale Gourdeau , Prakash Panangaden

Time-delay systems are an important class of dynamical systems which provide a solid mathematical framework to deal with many application domains of interest ranging from biology, chemical, electrical, and mechanical engineering, to…

Dynamical Systems · Mathematics 2009-03-28 Giordano Pola , Pierdomenico Pepe , Maria D. Di Benedetto , Paulo Tabuada

We show that a history-based variant of alternating bisimulation with imperfect information allows it to be related to a variant of Alternating-time Temporal Logic (ATL) with imperfect information by a full Hennessy-Milner theorem. The…

Logic in Computer Science · Computer Science 2020-06-29 Francesco Belardinelli , Catalin Dima , Vadim Malvone , Ferucio Tiplea

Communicating transactions is a form of distributed, non-isolated transactions which provides a simple construct for building concurrent systems. In this paper we develop a logical framework to express properties of the observable behaviour…

Logic in Computer Science · Computer Science 2018-01-15 Vasileios Koutavas , Maciej Gazda , Matthew Hennessy

The Bayesian approach to machine learning amounts to computing posterior distributions of random variables from a probabilistic model of how the variables are related (that is, a prior distribution) and a set of observations of variables.…

Logic in Computer Science · Computer Science 2015-07-01 Johannes Borgström , Andrew D Gordon , Michael Greenberg , James Margetson , Jurgen Van Gael

In this paper we continue our research line on logical characterizations of behavioral metrics obtained from the definition of a metric over the set of logical properties of interest. This time we provide a characterization of both strong…

Logic in Computer Science · Computer Science 2017-07-14 Valentina Castiglioni , Simone Tini

This paper introduces a new behavioral system model with distinct external and internal signals possibly evolving on different time scales. This allows to capture abstraction processes or signal aggregation in the context of control and…

Systems and Control · Computer Science 2014-02-17 Anne-Kathrin Schmuck , Jörg Raisch

This paper investigates stochastic nondeterminism on continuous state spaces by relating nondeterministic kernels and stochastic effectivity functions to each other. Nondeterministic kernels are functions assigning each state a set o…

Logic in Computer Science · Computer Science 2015-07-07 Ernst-Erich Doberkat , Pedro Sánchez Terraf

Like notions of process equivalence, behavioural preorders on processes come in many flavours, ranging from fine-grained comparisons such as ready simulation to coarse-grained ones such as trace inclusion. Often, such behavioural preorders…

Logic in Computer Science · Computer Science 2021-05-03 Chase Ford , Stefan Milius , Lutz Schröder

We consider the state determination problem using Mutually Unbiased Bases(MUBs). For spin-1, spin-3/2 and spin-2 systems, analogous to Pauli operators of spin-1/2 system, which are experimentally implementable and correspond to the optimum…

Quantum Physics · Physics 2020-04-14 H S Smitha Rao , Swarnamala Sirsi , Karthik Bharath
‹ Prev 1 4 5 6 7 8 10 Next ›