A Game Characterization for Contrasimilarity

08/24/2021
by   Benjamin Bisping, et al.
0

We present the first game characterization of contrasimilarity, the weakest form of bisimilarity. The game is finite for finite-state processes and can thus be used for contrasimulation equivalence checking, of which no tool has been capable to date. A machine-checked Isabelle/HOL formalization backs our work and enables further use of contrasimilarity in verification contexts.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/06/2021

There and Back Again: From Bounded Checking to Verification of Program Equivalence via Symbolic Up-to Techniques

We present a bounded equivalence verification technique for higher-order...
research
06/23/2021

Weighted and Near Weighted Potential Games with Application to Game Theoretic Control

An algorithm is proposed to verify whether a finite game is a weighted p...
research
10/20/2019

Checking Timed Bisimulation with Bounded Zone-History Graphs – Technical Report

Timed automata (TA) are a well-established formalism for discrete-state/...
research
07/22/2019

Codensity Games for Bisimilarity

Bisimilarity as an equivalence notion of systems has been central to pro...
research
02/01/2023

The Investment Management Game: Extending the Scope of the Notion of Core

The core is a dominant solution concept in economics and game theory. In...
research
05/10/2022

How Game Jams and Hackathons Accelerate Design Processes

This dissertation presents three years of research on how design process...
research
07/13/2023

An update on the coin-moving game on the square grid

This paper extends the work started in 2002 by Demaine, Demaine and Veri...

Please sign up or login with your details

Forgot password? Click here to reset