License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2021.28
URN: urn:nbn:de:0030-drops-142664
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14266/
Go to the corresponding LIPIcs Volume Portal

Deifel, Hans-Peter ; Milius, Stefan ; Wißmann, Thorsten

Coalgebra Encoding for Efficient Minimization

pdf-format:
LIPIcs-FSCD-2021-28.pdf (0.8 MB)

Abstract

Recently, we have developed an efficient generic partition refinement algorithm, which computes behavioural equivalence on a state-based system given as an encoded coalgebra, and implemented it in the tool CoPaR. Here we extend this to a fully fledged minimization algorithm and tool by integrating two new aspects: (1) the computation of the transition structure on the minimized state set, and (2) the computation of the reachable part of the given system. In our generic coalgebraic setting these two aspects turn out to be surprisingly non-trivial requiring us to extend the previous theory. In particular, we identify a sufficient condition on encodings of coalgebras, and we show how to augment the existing interface, which encapsulates computations that are specific for the coalgebraic type functor, to make the above extensions possible. Both extensions have linear run time.

BibTeX - Entry

@InProceedings{deifel_et_al:LIPIcs.FSCD.2021.28,
  author =	{Deifel, Hans-Peter and Milius, Stefan and Wi{\ss}mann, Thorsten},
  title =	{{Coalgebra Encoding for Efficient Minimization}},
  booktitle =	{6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021)},
  pages =	{28:1--28:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-191-7},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{195},
  editor =	{Kobayashi, Naoki},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/14266},
  URN =		{urn:nbn:de:0030-drops-142664},
  doi =		{10.4230/LIPIcs.FSCD.2021.28},
  annote =	{Keywords: Coalgebra, Partition refinement, Transition systems, Minimization}
}

Keywords: Coalgebra, Partition refinement, Transition systems, Minimization
Collection: 6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021)
Issue Date: 2021
Date of publication: 06.07.2021

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI