首页    期刊浏览 2024年11月05日 星期二
登录注册

文章基本信息

  • 标题:Efficient Coalgebraic Partition Refinement
  • 本地全文:下载
  • 作者:Ulrich Dorsch ; Stefan Milius ; Lutz Schr{\"o}der
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2017
  • 卷号:85
  • 页码:32:1-32:16
  • DOI:10.4230/LIPIcs.CONCUR.2017.32
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要: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.
  • 关键词:markov chains; deterministic finite automata; partition refinement; generic algorithm; paige-tarjan algorithm; transition systems
国家哲学社会科学文献中心版权所有