# Explaining Behavioural Inequivalence Generically in Quasilinear Time

@article{Wimann2021ExplainingBI, title={Explaining Behavioural Inequivalence Generically in Quasilinear Time}, author={Thorsten Wi{\ss}mann and Stefan Milius and Lutz Schr{\"o}der}, journal={ArXiv}, year={2021}, volume={abs/2105.00669} }

We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is achieved by working with coalgebras for a set functor in the paradigm of universal coalgebra. For every behavioural equivalence class in a given system, we construct a formula which holds precisely at the states in that class. The algorithm instantiates to…

## Figures from this paper

## 3 Citations

### Distributed Coalgebraic Partition Refinement

- Computer ScienceTACAS
- 2022

An algorithm due to Blom and Orzan, suitable for a distributed implementation to the coalgebraic level of genericity, is extended and implemented in CoPaR, and experiments show that this allows to handle much larger state spaces.

### Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence

- Computer ScienceArXiv
- 2022

. We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nonde-terministic, probabilistic or…

### A Game for Linear-time–Branching-time Spectroscopy

- MathematicsTACAS
- 2021

A generalization of the bisimulation game that can be employed to find all relevant distinguishing Hennessy–Milner logic formulas for two compared finite-state processes and the induced algorithm can determine the best fit of (in)equivalences for a pair of processes is introduced.

## References

SHOWING 1-10 OF 47 REFERENCES

### Explaining Non-Bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas

- Computer ScienceCMCS
- 2020

This paper focuses on generic algorithms for computing the winning strategies of both players in a bisimulation game and generates a modal formula that distinguishes the given non-bisimilar states.

### Aggregation-based minimization of finite state automata

- Computer ScienceActa Informatica
- 2020

This work presents a minimization algorithm for non-deterministic finite state automata that finds and merges bisimulation-equivalent states and simultaneously generalises and simplifies an earlier one by Watson and Daciuk for deterministic devices.

### Generic Partition Refinement and Weighted Tree Automata

- Computer ScienceFM
- 2019

The run time analysis of this algorithm is refined to cover additional instances, notably weighted automata and, more generally, weighted tree automata, and to match the run time of the best known algorithms for many concrete types of systems.

### Constructive logical characterizations of bisimilarity for reactive probabilistic systems

- Computer ScienceTheor. Comput. Sci.
- 2019

### Efficient and Modular Coalgebraic Partition Refinement

- Computer ScienceLog. Methods Comput. Sci.
- 2020

A generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification, and yields a toolbox for efficient partition refinement algorithms.

### Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages

- Computer ScienceCMCS
- 2018

A generic expression language describing behaviours of finite coalgebras over sets and a generic Kleene-type theorem establishing a correspondence between these expressions and finite systems is introduced.

### Efficient Minimization of DFAs with Partial Transition

- Computer ScienceSTACS
- 2008

An algorithm for minimizing a PT-DFA in O(m lg n) time and $O(m+n+alpha)$ memory, where n is the number of states, m is thenumber of defined transitions, and $alpha$ is the size of the alphabet.

### Simple O(m logn) Time Markov Chain Lumping

- Computer ScienceTACAS
- 2010

This article presents an algorithm for sorting weights with a combination of the so-called possible majority candidate algorithm with any O(k logk) sorting algorithm, which works because the weights consist of two groups, one of which is sufficiently small and all weights in the other group have the same value.