DeepAI AI Chat
Log In Sign Up

Efficient and Modular Coalgebraic Partition Refinement

06/14/2018
by   Thorsten Wißmann, et al.
0

We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, a task arising in different contexts. Coalgebraic generality allows us to not only cover classical relational systems and various forms of weighted systems but way can combine existing system types in various ways. Under assumptions on the type functor that allow representing its finite coalgebras in terms of nodes and edges, our algorithm runs in time O(m· n) where n and m are the numbers of nodes and edges, respectively. The generic complexity results and the possibilities of combining system types is a toolbox for efficient partition refinement algorithms. Instances of our generic algorithm thus match the runtime of the best known algorithms for unlabelled transition systems, Markov chains, and deterministic automata (with fixed alphabets), and improve the best known algorithms for Segala systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/21/2018

CoPaR: An Efficient Generic Partition Refiner

Partition refinement is a method for minimizing automata and transition ...
04/02/2020

From Generic Partition Refinement to Weighted Tree Automata Minimization

Partition refinement is a method for minimizing automata and transition ...
04/13/2022

Distributed Coalgebraic Partition Refinement

Partition refinement is a method for minimizing automata and transition ...
07/08/2022

Partition refinement for emulation

Kripke models are useful to express static knowledge or belief. On the o...
02/25/2021

Coalgebra Encoding for Efficient Minimization

Recently, we have developed an efficient generic partition refinement al...
03/21/2022

Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence

We provide a generic algorithm for constructing formulae that distinguis...