DeepAI AI Chat
Log In Sign Up

From Generic Partition Refinement to Weighted Tree Automata Minimization

04/02/2020
by   Thorsten Wißmann, et al.
0

Partition refinement is a method for minimizing automata and transition systems of various types. Recently, we have developed a partition refinement algorithm that is generic in the transition type of the given system and matches the run time of the best known algorithms for many concrete types of systems, e.g. deterministic automata as well as ordinary, weighted, and probabilistic (labelled) transition systems. Genericity is achieved by modelling transition types as functors on sets, and systems as coalgebras. In the present work, we refine the run time analysis of our algorithm to cover additional instances, notably weighted automata and, more generally, weighted tree automata. For weights in a cancellative monoid we match, and for non-cancellative monoids such as (the additive monoid of) the tropical semiring even substantially improve, the asymptotic run time of the best known algorithms. We have implemented our algorithm in a generic tool that is easily instantiated to concrete system types by implementing a simple refinement interface. Moreover, the algorithm and the tool are modular, and partition refiners for new types of systems are obtained easily by composing pre-implemented basic functors. Experiments show that even for complex system types, the tool is able to handle systems with millions of transitions.

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/13/2022

Distributed Coalgebraic Partition Refinement

Partition refinement is a method for minimizing automata and transition ...
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...
06/14/2018

Efficient and Modular Coalgebraic Partition Refinement

We present a generic partition refinement algorithm that quotients coalg...
12/17/2021

Morphisms and minimisation of weighted automata

This paper studies the algorithms for the minimisation of weighted autom...
05/03/2021

Explaining Behavioural Inequivalence Generically in Quasilinear Time

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