English
Related papers

Related papers: Conformance Games for Graded Semantics

200 papers

The framework of graded semantics uses graded monads to capture behavioural equivalences of varying granularity, for example as found on the linear-time/branching-time spectrum, over general system types. We describe a generic…

Logic in Computer Science · Computer Science 2024-05-08 Chase Ford , Harsh Beohar , Barbara König , Stefan Milius , Lutz Schröder

State-based models of concurrent systems are traditionally considered under a variety of notions of process equivalence. In the particular case of labelled transition systems, these equivalences range from trace equivalence to (strong)…

Logic in Computer Science · Computer Science 2020-10-21 Ulrich Dorsch , Stefan Milius , Lutz Schröder

The analysis of concurrent and reactive systems is based to a large degree on various notions of process equivalence, ranging, on the so-called linear-time/branching-time spectrum, from fine-grained equivalences such as strong bisimilarity…

Logic in Computer Science · Computer Science 2014-10-17 Alexander Kurz , Stefan Milius , Dirk Pattinson , Lutz Schröder

We develop methods to formally describe and compare games, in order to probe questions of game structure and design, and as a stepping stone to predicting player behavior from design patterns. We define a grammar-like formalism to describe…

Logic in Computer Science · Computer Science 2021-01-05 Paul Riggins , David McPherson

Timed transition systems are behavioural models that include an explicit treatment of time flow and are used to formalise the semantics of several foundational process calculi and automata. Despite their relevance, a general mathematical…

Logic in Computer Science · Computer Science 2023-06-22 Tomasz Brengos , Marco Peressotti

Bisimilarity as an equivalence notion of systems has been central to process theory. Due to the recent rise of interest in quantitative systems (probabilistic, weighted, hybrid, etc.), bisimilarity has been extended in various ways:…

Logic in Computer Science · Computer Science 2019-07-24 Yuichi Komorida , Shin-ya Katsumata , Nick Hu , Bartek Klin , Ichiro Hasuo

We characterize all common notions of behavioral equivalence by one 6-dimensional energy game, where energies bound capabilities of an attacker trying to tell processes apart. The defender-winning initial credits exhaustively determine…

Data Structures and Algorithms · Computer Science 2023-07-21 Benjamin Bisping

This paper presents a new model for word sense disambiguation formulated in terms of evolutionary game theory, where each word to be disambiguated is represented as a node on a graph whose edges represent word relations and senses are…

Artificial Intelligence · Computer Science 2017-04-07 Rocco Tripodi , Marcello Pelillo

Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as games on which proofs induce strategies. We are specifically…

Logic in Computer Science · Computer Science 2015-05-18 Samuel Mimram

Behavioural metrics provide a quantitative refinement of classical two-valued behavioural equivalences on systems with quantitative data, such as metric or probabilistic transition systems. In analogy to the linear-time/branching-time…

Logic in Computer Science · Computer Science 2025-01-28 Jonas Forster , Lutz Schröder , Paul Wild , Harsh Beohar , Sebastian Gurke , Barbara König , Karla Messing

We introduce operational semantics into games. And based on the operational semantics, we establish a full algebra of games, including basic algebra of games, algebra of concurrent games, recursion and abstraction. The algebra can be used…

Logic in Computer Science · Computer Science 2019-09-04 Yong Wang

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

In this work, we design the game semantics for timed equivalences and preorders of timed processes. The timed games corresponding to the various timed relations form a hierarchy. These games are similar to Stirling's bisimulation games. If…

Formal Languages and Automata Theory · Computer Science 2012-06-29 Shibashis Guha , Shankara Narayanan Krishna

Several application domains require formal but flexible approaches to the comparison problem. Different process models that cannot be related by behavioral equivalences should be compared via a quantitative notion of similarity, which is…

Logic in Computer Science · Computer Science 2010-06-29 Alessandro Aldini

Game semantics aim at describing the interactive behaviour of proofs by interpreting formulas as games on which proofs induce strategies. In this article, we introduce a game semantics for a fragment of first order propositional logic. One…

Logic in Computer Science · Computer Science 2008-12-18 Samuel Mimram

We propose behavioral specification theories for most equivalences in the linear-time--branching-time spectrum. Almost all previous work on specification theories focuses on bisimilarity, but there is a clear interest in specification…

Logic in Computer Science · Computer Science 2019-10-21 Uli Fahrenberg , Axel Legay

Parity games play a central role in model checking and satisfiability checking. Solving parity games is computationally expensive, among others due to the size of the games, which, for model checking problems, can easily contain $10^9$…

Logic in Computer Science · Computer Science 2016-03-22 S. Cranen , J. J. A. Keiren , T. A. C. Willemse

Many definitions of business processes refer to business goals, value creation, or profits/gains of sorts. Nevertheless, the focus of formal methods research on business processes, like the well-known soundness property, lies on correctness…

Computer Science and Game Theory · Computer Science 2020-06-12 Tobias Heindel , Ingo Weber

Process equivalences are formal methods that relate programs and system which, informally, behave in the same way. Since there is no unique notion of what it means for two dynamic systems to display the same behaviour there are a multitude…

Logic in Computer Science · Computer Science 2012-10-10 Martin Lange , Etienne Lozes , Manuel Vargas Guzmán

We revisit the crucial issue of natural game equivalences, and semantics of game logics based on these. We present reasons for investigating finer concepts of game equivalence than equality of standard powers, though staying short of modal…

Computer Science and Game Theory · Computer Science 2017-07-28 Johan van Benthem , Nick Bezhanishvili , Sebastian Enqvist
‹ Prev 1 2 3 10 Next ›