arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.1046cs.LO
收藏

从自动机到余代数的确定性推广

Generalizing determinization from automata to coalgebras

Alexandra Silva, Filippo Bonchi, Marcello Bonsangue, Jan Rutten

摘要:

幂集构造是将非确定性自动机转换为识别同一语言的确定性自动机的标准方法。在本文中,我们提升了幂集的建设,从自动机的更一般的框架与结构状态空间的余代数。余代数是统一研究不同类型动力系统的抽象框架。内函子F决定了系统的类型(F-余代数)和它们之间的行为等价(~_F)的概念。许多类型的转移系统及其等价可以被函子F捕获。例如,对于确定性自动机,导出的等价是语言等价,而对于非确定性自动机,它是普通的双相似性。我们给出了几个应用的例子,我们的广义确定性建设,包括部分Mealy机,(结构化)摩尔自动机,拉宾概率自动机,甚至有点令人惊讶的是,下推自动机。为了进一步证明的一般性的方法,我们展示了如何coalgebraically几个等价物,已在并发社区的兴趣对象,如故障或准备语义的特征。

英文摘要:

The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this paper, we lift the powerset construction from automata to the more general framework of coalgebras with structured state spaces. Coalgebra is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion of behavioural equivalence (~_F) amongst them. Many types of transition systems and their equivalences can be captured by a functor F. For example, for deterministic automata the derived equivalence is language equivalence, while for non-deterministic automata it is ordinary bisimilarity. We give several examples of applications of our generalized determinization construction, including partial Mealy machines, (structured) Moore automata, Rabin probabilistic automata, and, somewhat surprisingly, even pushdown automata. To further witness the generality of the approach we show how to characterize coalgebraically several equivalences which have been object of interest in the concurrency community, such as failure or ready semantics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑