License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2017.32
URN: urn:nbn:de:0030-drops-77939
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7793/
Go to the corresponding LIPIcs Volume Portal

Dorsch, Ulrich ; Milius, Stefan ; Schröder, Lutz ; Wißmann, Thorsten

Efficient Coalgebraic Partition Refinement

pdf-format:
LIPIcs-CONCUR-2017-32.pdf (0.6 MB)

Abstract

We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in reactive verification; coalgebraic generality implies in particular that we cover not only classical relational systems but also various forms of weighted systems. 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 log n) where n and m are the numbers of nodes and edges, respectively. 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.

BibTeX - Entry

@InProceedings{dorsch_et_al:LIPIcs:2017:7793,
  author =	{Ulrich Dorsch and Stefan Milius and Lutz Schr{\"o}der and Thorsten Wi{\ss}mann},
  title =	{{Efficient Coalgebraic Partition Refinement}},
  booktitle =	{28th International Conference on Concurrency Theory (CONCUR 2017)},
  pages =	{32:1--32:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-048-4},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{85},
  editor =	{Roland Meyer and Uwe Nestmann},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7793},
  URN =		{urn:nbn:de:0030-drops-77939},
  doi =		{10.4230/LIPIcs.CONCUR.2017.32},
  annote =	{Keywords: markov chains, deterministic finite automata, partition refinement, generic algorithm, paige-tarjan algorithm, transition systems}
}

Keywords: markov chains, deterministic finite automata, partition refinement, generic algorithm, paige-tarjan algorithm, transition systems
Collection: 28th International Conference on Concurrency Theory (CONCUR 2017)
Issue Date: 2017
Date of publication: 01.09.2017

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