Process Equivalence Problems as Energy Games

03/03/2023
by   Benjamin Bisping, et al.
0

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 determine exhaustively which preorders and equivalences from the (strong) linear-time–branching-time spectrum relate processes. The time complexity is exponential, which is optimal due to trace equivalence being covered. This complexity improves drastically on our recent approach for deciding groups of equivalences where exponential sets of distinguishing HML formulas are constructed on top of a super-exponential reachability game. In experiments using the VLTS benchmarks, the algorithm performs on par with the best similarity algorithm.

READ FULL TEXT
research
05/28/2023

Linear-Time–Branching-Time Spectroscopy Accounting for Silent Steps

We provide the first generalized game characterization of van Glabbeek's...
research
09/30/2021

Deciding All Behavioral Equivalences at Once: A Game for Linear-time–Branching-time Spectroscopy

We introduce a generalization of the bisimulation game that can be emplo...
research
12/04/2018

Graded Monads for the Linear Time - Branching Time Spectrum

State-based models of concurrent systems are traditionally considered un...
research
03/29/2022

Graded Monads and Behavioural Equivalence Games

The framework of graded semantics uses graded monads to capture behaviou...
research
03/09/2019

Trace Equivalence and Epistemic Logic to Express Security Properties

In process algebras, security properties are expressed as equivalences b...
research
03/26/2019

Computing the Homology of Semialgebraic Sets. II: General formulas

We describe and analyze an algorithm for computing the homology (Betti n...

Please sign up or login with your details

Forgot password? Click here to reset