DeepAI
Log In Sign Up

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

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...
10/20/2019

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

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

Codensity Games for Bisimilarity

Bisimilarity as an equivalence notion of systems has been central to pro...
05/10/2022

How Game Jams and Hackathons Accelerate Design Processes

This dissertation presents three years of research on how design process...
07/27/2017

A New Game Equivalence and its Modal Logic

We revisit the crucial issue of natural game equivalences, and semantics...
11/02/2021

A Finite Characterization of Perfect Equilibria

Govindan and Klumpp [7] provided a characterization of perfect equilibri...