English
Related papers

Related papers: Quantitative Graded Semantics and Spectra of Behav…

200 papers

Graded monads refine traditional monads using effect annotations in order to describe quantitatively the computational effects that a program can generate. They have been successfully applied to a variety of formal systems for reasoning…

Logic in Computer Science · Computer Science 2026-01-22 Satoshi Kura , Marco Gaboardi , Taro Sekiyama , Hiroshi Unno

We combine quantified differential dynamic logic (QdL) for reasoning about the possible behavior of distributed hybrid systems with temporal logic for reasoning about the temporal behavior during their operation. Our logic supports…

Logic in Computer Science · Computer Science 2012-07-12 Ping Hou

Temporal logics stands for a widely adopted family of formalisms for the verification of computational devices, enriching propositional logics by operators predicating on the step-wise behaviour of a system. Its quantified extensions allow…

Logic in Computer Science · Computer Science 2022-01-05 Fabio Gadducci , Davide Trotta

This paper explores the problem of uncertainty quantification in the behavioral setting for data-driven control. Building on classical ideas from robust control, the problem is regarded as that of selecting a metric which is best suited to…

Optimization and Control · Mathematics 2022-04-07 Alberto Padoan , Jeremy Coulson , Henk J. van Waarde , John Lygeros , Florian Dörfler

Behavioural distances provide a robust alternative to notions of equivalence such as bisimilarity in the context of probabilistic transition systems. They can be defined as least fixed points, whose universal property allows us to exhibit…

Logic in Computer Science · Computer Science 2025-10-14 Ruben Turkenburg , Harsh Beohar , Franck van Breugel , Clemens Kupke , Jurriaan Rot

This paper studies the quantitative refinements of Abramsky's applicative similarity and bisimilarity in the context of a generalisation of Fuzz, a call-by-value $\lambda$-calculus with a linear type system that can express programs…

Logic in Computer Science · Computer Science 2018-02-07 Francesco Gavazzo

The combination of nondeterminism and probability in concurrent systems lead to the development of several interpretations of process behavior. If we restrict our attention to linear properties only, we can identify three main approaches to…

Logic in Computer Science · Computer Science 2018-08-28 Valentina Castiglioni

Bisimulation is a concept that captures behavioural equivalence of states in a variety of types of transition systems. It has been widely studied in a discrete-time setting where the notion of a step is fundamental. In our setting we are…

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

Experimental results presented in this paper supports the hypothesis on quantum-like statistical behaviour of cognitive systems (at least human beings). Our quantum-like approach gives the possibility to represent mental states by Hilbert…

This note sketches the extension of the basic characterisation theorems as the bisimulation-invariant fragment of first-order logic to modal logic with graded modalities and matching adaptation of bisimulation. We focus on showing…

Logic · Mathematics 2023-07-19 Martin Otto

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

The paper investigates behavioural equivalence between programs in a call-by-value functional language extended with a signature of (algebraic) effect-triggering operations. Two programs are considered as being behaviourally equivalent if…

Logic in Computer Science · Computer Science 2019-10-28 Alex Simpson , Niels Voorneveld

Modal logics allow reasoning about various modes of truth: for example, what it means for something to be possibly true, or to know that something is true as opposed to merely believing it. This report describes embeddings of propositional…

Logic in Computer Science · Computer Science 2022-05-16 John Rushby

In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times…

Artificial Intelligence · Computer Science 2024-11-20 Arvid Becker , Pedro Cabalar , Martín Diéguez , Torsten Schaub , Anna Schuhmann

Modal automata are a classic formal model for component-based systems that comes equipped with a rich specification theory supporting abstraction, refinement and compositional reasoning. In recent years, quantitative variants of modal…

Logic in Computer Science · Computer Science 2013-06-13 Tingting Han , Christian Krause , Marta Kwiatkowska , Holger Giese

Within the possibilistic approach to uncertainty modeling, the paper presents a modal logical system to reason about qualitative (comparative) statements of the possibility (and necessity) of fuzzy propositions. We relate this qualitative…

Logic in Computer Science · Computer Science 2013-02-28 Petr Hajek , Dagmar Harmancová , Francesc Esteva , Pere Garcia , Lluis Godo

Graded type theories are an emerging paradigm for augmenting the reasoning power of types with parameterizable, fine-grained analyses of program properties. There have been many such theories in recent years which equip a type theory with…

Logic in Computer Science · Computer Science 2021-02-23 Benjamin Moon , Harley Eades , Dominic Orchard

The need for high-throughput, precise, and meaningful methods for measuring behavior has been amplified by our recent successes in measuring and manipulating neural circuitry. The largest challenges associated with moving in this direction,…

Biological Physics · Physics 2017-12-18 Gordon J. Berman

Temporal networks, i.e., networks in which the interactions among a set of elementary units change over time, can be modelled in terms of time-varying graphs, which are time-ordered sequences of graphs over a set of nodes. In such graphs,…

Physics and Society · Physics 2013-06-04 Vincenzo Nicosia , John Tang , Cecilia Mascolo , Mirco Musolesi , Giovanni Russo , Vito Latora

In movement ecology, the few works that have taken collective behaviour into account are data-driven and rely on simplistic theoretical assumptions, relying in metrics that may or may not be measuring what is intended. In the present paper,…

Quantitative Methods · Quantitative Biology 2019-03-18 Rocio Joo , Marie-Pierre Etienne , Nicolas Bez , Stéphanie Mahévas