English
Related papers

Related papers: Positive Hennessy-Milner Logic for Branching Bisim…

200 papers

We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original definition of branching bisimilarity with explicit divergence in…

Logic in Computer Science · Computer Science 2008-12-17 Rob van Glabbeek , Bas Luttik , Nikola Trcka

Multi-state models are frequently applied for representing processes evolving through a discrete set of state. Important classes of multi-state models arise when transitions between states may depend on the time since entry into the current…

Methodology · Statistics 2022-02-28 Rosario Barone , Andrea Tancredi

In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as close as possible to the Bayesian and is unrestricted, that is one is able to use any operator without restriction. A notion of…

Logic · Mathematics 2016-09-07 Frederic Dambreville

Hybrid machine learning based on Hamiltonian formulations has recently been successfully demonstrated for simple mechanical systems, both energy conserving and not energy conserving. We introduce a pseudo-Hamiltonian formulation that is a…

Machine Learning · Computer Science 2023-02-15 Sølve Eidnes , Alexander J. Stasik , Camilla Sterud , Eivind Bøhn , Signe Riemer-Sørensen

In this paper we consider Modal Team Logic, a generalization of Classical Modal Logic in which it is possible to describe dependence phenomena between data. We prove that most known fragment of Full Modal Team Logic allow the elimination of…

Logic in Computer Science · Computer Science 2018-10-15 Giovanna D'Agostino

We study the underlying mathematical properties of various partial order models of concurrency based on transition systems, Petri nets, and event structures, and show that the concurrent behaviour of these systems can be captured in a…

Logic in Computer Science · Computer Science 2010-11-05 Julian Gutierrez

Machines that can replicate human intelligence with type 2 reasoning capabilities should be able to reason at multiple levels of spatio-temporal abstractions and scales using internal world models. Devising formalisms to develop such…

Artificial Intelligence · Computer Science 2025-07-01 Vaisakh Shaj

We define a bi-directional embedding between hypersequent calculi and a subclass of systems of rules (2-systems). In addition to showing that the two proof frameworks have the same expressive power, the embedding allows for the recovery of…

Logic · Mathematics 2018-05-15 Agata Ciabattoni , Francesco A. Genco

Hybrid Communicating Sequential Processes (HCSP) is a powerful formal modeling language for hybrid systems, which is an extension of CSP by introducing differential equations for modeling continuous evolution and interrupts for modeling…

Logic in Computer Science · Computer Science 2016-09-09 Gaogao Yan , Li Jiao , Yangjia Li , Shuling Wang , Naijun Zhan

We introduce a new family of separability criteria that are based on the existence of extensions of a bipartite quantum state $\rho$ to a larger number of parties satisfying certain symmetry properties. It can be easily shown that all…

Quantum Physics · Physics 2007-05-23 Andrew C. Doherty , Pablo A. Parrilo , Federico M. Spedalieri

We explore an inquisitive modal logic designed to reason about neighborhood models. This logic is based on an inquisitive strict conditional operator, which quantifies over neighborhoods, and which can be applied to both statements and…

Logic · Mathematics 2024-11-11 Ivano Ciardelli

From the interpretation of Linear Logic multiplicative disjunction as the $\varepsilon$-product defined by Laurent Schwartz, we construct several models of Differential Linear Logic based on usual mathematical notions of smooth maps. This…

Logic in Computer Science · Computer Science 2017-12-21 Yoann Dabrowski , Marie Kerjean

A hidden-variable model is explicitly constructed by use of a Liouvillian description for the dynamics of two coupled spin-1/2 particles. In this model, the underlying Hamiltonian trajectories play the role of deterministic hidden…

Quantum Physics · Physics 2017-06-14 L. S. Silveira , R. M. Angelo

We first study labeled transition systems with explicit successful termination. We establish the notions of strong, weak, and branching bisimulation in terms of boolean matrix theory, introducing thus a novel and powerful algebraic…

Logic in Computer Science · Computer Science 2009-12-12 Nikola Trčka

Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to…

Logic in Computer Science · Computer Science 2016-09-15 Carlos Areces , Raul Fervari , Guillaume Hoffmann , Mauricio Martel

There exist two notions of equivalence of behavior between states of a Labelled Markov Process (LMP): state bisimilarity and event bisimilarity. The first one can be considered as an appropriate generalization to continuous spaces of Larsen…

Logic in Computer Science · Computer Science 2022-12-26 Martín Santiago Moroni , Pedro Sánchez Terraf

We study bisimulation and context equivalence in a probabilistic $\lambda$-calculus. The contributions of this paper are threefold. Firstly we show a technique for proving congruence of probabilistic applicative bisimilarity. While the…

Programming Languages · Computer Science 2013-11-08 Ugo Dal Lago , Davide Sangiorgi , Michele Alberti

A commuting $n$-tuple $(T_1, \ldots, T_n)$ of bounded linear operators on a Hilbert space $\clh$ associate a Hilbert module $\mathcal{H}$ over $\mathbb{C}[z_1, \ldots, z_n]$ in the following sense: \[\mathbb{C}[z_1, \ldots, z_n] \times…

Functional Analysis · Mathematics 2014-09-30 Jaydeb Sarkar

In systems involving quantitative data, such as probabilistic, fuzzy, or metric systems, behavioural distances provide a more fine-grained comparison of states than two-valued notions of behavioural equivalence or behaviour inclusion. Like…

Logic in Computer Science · Computer Science 2023-06-22 Paul Wild , Lutz Schröder

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
‹ Prev 1 8 9 10 Next ›