English
Related papers

Related papers: Modal Characterisations of Behavioural Pseudometri…

200 papers

We introduce simulations for modal logics with subclassical negations and restoration modalities, establish an adequacy theorem, and prove intrinsic (Hennessy-Milner-type) and relative (Van Benthem-type) characterization results. These…

Logic · Mathematics 2025-12-18 Jim de Groot , João Marcos , Rodrigo Stefanes

We consider state-based systems modelled as coalgebras whose type incorporates branching, and show that by suitably adapting the definition of coalgebraic bisimulation, one obtains a general and uniform account of the linear-time behaviour…

Logic in Computer Science · Computer Science 2013-09-05 Corina Cirstea

There exists a wide variety of works on the dynamics of large populations ranging from simple heuristic modeling to those based on advanced computer supported methods. Their interconnections, however, remain mostly vague, which…

Dynamical Systems · Mathematics 2023-04-27 Yuri Kozitsky , Krzysztof Pilorz

There are known characterisations of several fragments of hybrid logic by means of invariance under bisimulations of some kind. The fragments include $\{\store, \jump\}$ with or without nominals (Areces, Blackburn, Marx), $\jump$ with or…

Logic · Mathematics 2026-01-14 Guillermo Badia , Daniel Gaina , Alex Knapp , Tomasz Kowalski , Martin Wirsing

We explore further the suggestion to describe a pre- and post-selected system by a two-state, which is determined by two conditions. Starting with a formal definition of a two-state Hilbert space and basic operations, we systematically…

Quantum Physics · Physics 2009-10-28 B. Reznik , Y. Aharonov

Prevalent in biomedical applications (e.g., human phenotype research), multimodal datasets can provide valuable insights into the underlying physiological mechanisms. However, current machine learning (ML) models designed to analyze these…

Estimating statistical models within sensor networks requires distributed algorithms, in which both data and computation are distributed across the nodes of the network. We propose a general approach for distributed learning based on…

Machine Learning · Computer Science 2012-07-03 Qiang Liu , Alexander Ihler

The paper studies an extension to nonlinear systems of a recently proposed approach to the concept of modal participation factors. First, a definition is given for local mode-in-state participation factors for smooth nonlinear autonomous…

Systems and Control · Computer Science 2018-11-13 Boumediene Hamzi , Eyad Abed

In contrast to the existing approaches to bisimulation for fuzzy systems, we introduce a behavioral distance to measure the behavioral similarity of states in a nondeterministic fuzzy-transition system. This behavioral distance is defined…

Artificial Intelligence · Computer Science 2015-03-19 Yongzhi Cao , Huaiqing Wang , Sherry X. Sun , Guoqing Chen

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

In 1992 Wang & Larsen extended the may- and must preorders of De Nicola and Hennessy to processes featuring probabilistic as well as nondeterministic choice. They concluded with two problems that have remained open throughout the years,…

Logic in Computer Science · Computer Science 2015-07-01 Yuxin Deng , Matthew Hennessy , Rob van Glabbeek , Carroll Morgan

We consider probabilistic systems with hidden state and unobservable transitions, an extension of Hidden Markov Models (HMMs) that in particular admits unobservable {\epsilon}-transitions (also called null transitions), allowing state…

Machine Learning · Computer Science 2022-05-30 Rebecca Bernemann , Barbara König , Matthias Schaffeld , Torben Weis

In this paper we present {\em refinement modal logic}. A refinement is like a bisimulation, except that from the three relational requirements only `atoms' and `back' need to be satisfied. Our logic contains a new operator 'all' in addition…

Logic in Computer Science · Computer Science 2018-02-06 Laura Bozzelli , Hans van Ditmarsch , Tim French , James Hales , Sophie Pinchinat

Open bisimilarity is defined for open process terms in which free variables may appear. The insight is, in order to characterise open bisimilarity, we move to the setting of intuitionistic modal logics. The intuitionistic modal logic…

Logic in Computer Science · Computer Science 2023-06-22 Ki Yung Ahn , Ross Horne , Alwen Tiu

In this short paper we will discuss the similarities and differences between two semantic approaches to modal logics - non-deterministic semantics and restricted non-deterministic semantics. Generally speaking, both kinds of semantics are…

Logic in Computer Science · Computer Science 2025-01-03 Marcelo E. Coniglio , Paweł Pawłowski , Daniel Skurt

Recently, Baltag and van Benthem arXiv:2103.14946 [cs.LO] introduced a new decidable logic of functional dependence (LFD) with local dependence formulas and dependence quantifiers. The language is interpreted over dependence models, which…

Logic in Computer Science · Computer Science 2021-07-14 Raoul Koudijs

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

The task of state estimation in active distribution systems faces a major challenge due to the integration of different measurements with multiple reporting rates. As a result, distribution systems are essentially unobservable in real time,…

Optimization and Control · Mathematics 2024-05-13 J. G. De la Varga , S. Pineda , J. M. Morales , Á. Porras

The higher-dimensional modal mu-calculus is an extension of the mu-calculus in which formulas are interpreted in tuples of states of a labeled transition system. Every property that can be expressed in this logic can be checked in…

Logic in Computer Science · Computer Science 2012-02-17 Martin Lange , Etienne Lozes

Inquisitive modal logic, InqML, in its epistemic incarnation, extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. We use the natural notion of…

Logic · Mathematics 2025-02-13 Ivano Ciardelli , Martin Otto