Graded Monads and Behavioural Equivalence Games

by   Harsh Beohar, et al.

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 Spoiler-Duplicator game for graded semantics that is extracted from the given graded monad, and may be seen as playing out an equational proof; instances include standard pebble games for simulation and bisimulation as well as games for trace-like equivalences and coalgebraic behavioural equivalence. Considerations on an infinite variant of such games lead to a novel notion of infinite-depth graded semantics. Under reasonable restrictions, the infinite-depth graded semantics associated to a given graded equivalence can be characterized in terms of a determinization construction for coalgebras under the equivalence at hand.


page 1

page 2

page 3

page 4


Graded Monads for the Linear Time - Branching Time Spectrum

State-based models of concurrent systems are traditionally considered un...

Extensive Infinite Games and Escalation, an exercise in Agda

Escalation in games is when agents keep playing forever. Based on formal...

Bisimilarity of Open Terms in Stream GSOS

Stream GSOS is a specification format for operations and calculi on infi...

On the Axiomatisability of Parallel Composition

This paper studies the existence of finite equational axiomatisations of...

Coalgebraic modal logic and games for coalgebras with side effects

We study coalgebraic modal logic and games to characterise behavioural e...

Failure Trace Semantics for a Process Algebra with Time-outs (preliminary report)

This paper extends a standard process algebra with a time-out operator, ...

On Equivalence and Cores for Incomplete Databases in Open and Closed Worlds

Data exchange heavily relies on the notion of incomplete database instan...