From Generic Partition Refinement to Weighted Tree Automata Minimization

  title={From Generic Partition Refinement to Weighted Tree Automata Minimization},
  author={Thorsten Wi{\ss}mann and Hans-Peter Deifel and Stefan Milius and Lutz Schr{\"o}der},
  journal={Formal Aspects Comput.},
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… 
Coalgebra Encoding for Efficient Minimization
This work identifies a sufficient condition on encodings of coalgebras, and shows how to augment the existing interface, which encapsulates computations that are specific for the coalgebraic type functor, to make the above extensions possible.
Distributed Coalgebraic Partition Refinement
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.
Coalgebraic Partition Refinement For All Functors
Transition systems that previously required half an hour on HPC clusters can be minimized in seconds on a single core of a laptop by the proposed coalgebraic partition refinement algorithm.
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
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;


Generic Partition Refinement and Weighted Tree Automata
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.
Efficient and Modular Coalgebraic Partition Refinement
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.
Efficient Coalgebraic Partition Refinement
A generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in reactive verification, and match the runtime of the best known algorithms for unlabelled transition systems, Markov chains, and deterministic automata (with fixed alphabets), and improve the bestknown algorithms for Segala systems.
Aggregation-based minimization of finite state automata
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.
Generalizing determinization from automata to coalgebras
This paper lifts the powerset construction from automata to the more general framework of coal- gebras with structured state spaces and shows how to characterize coalgebraically several equivalences which have been object of interest in the concurrency community, such as failure or ready semantics.
Deciding Bisimilarity and Similarity for Probabilistic Processes
Algorithms for computing this bisimulation equivalence classes as introduced by Larsen and Skou, the simulation preorder a la Segala and Lynch, and the reduction to maximum flow problems in suitable networks are presented.
Simple Bisimilarity Minimization in O(m log n) Time
  • A. Valmari
  • Computer Science
    Fundam. Informaticae
  • 2010
A new algorithm for bisimilarity minimization of labelled directed graphs is presented, based on refining a partition of states with respect to the labelled transitions, which meets this bound even if the number of different labels of transitions is not fixed.
Nominal Automata with Name Binding
An automaton model over nominal sets is introduced, regular nondeterministic nominal automata RNNA, which have a natural coalgebraic definition using abstraction sets to capture transitions that read a fresh letter from the input word.
The Category of Simulations for Weighted Tree Automata
It is shown in several cases (fields, commutative rings, NOETHERIAN semirings, semiring of natural numbers) that all equivalent wta M and N can be joined by a finite chain of simulations.