Span(图):开放转移系统的规范反馈代数
Span(Graph): a Canonical Feedback Algebra of Open Transition Systems
摘要:
本文证明了由Katis,Sabadini和Walters提出的开迁移系统的代数Span(Graph)* 满足一个泛性质.就其本身而言,这是该并发模型的规范性的理由。然而,泛性质本身是有趣的,作为反馈和状态之间关系的正式证明。事实上,反馈范畴最初也是由Katis,Sabadini和Walters提出的,是对可追踪幺半范畴的削弱,在计算机科学中有各种应用。一个状态自举技术,出现在几个不同的上下文中,产生免费的这样的类别。我们证明了Span(Graph)* 是以这种方式产生的,它是Span(Set)上的自由反馈范畴。假设后者可以被看作是谓词的代数,那么开放迁移系统的代数就这样产生了--粗略地说--作为自举状态到那个代数的结果。最后,我们推广的反馈类别赋予状态空间额外的结构:这将框架从单纯的过渡系统的自动机与初始和最终状态。
英文摘要:
We show that Span(Graph)*, an algebra for open transition systems introduced by Katis, Sabadini and Walters, satisfies a universal property. By itself, this is a justification of the canonicity of this model of concurrency. However, the universal property is itself of interest, being a formal demonstration of the relationship between feedback and state. Indeed, feedback categories, also originally proposed by Katis, Sabadini and Walters, are a weakening of traced monoidal categories, with various applications in computer science. A state bootstrapping technique, which has appeared in several different contexts, yields free such categories. We show that Span(Graph)* arises in this way, being the free feedback category over Span(Set). Given that the latter can be seen as an algebra of predicates, the algebra of open transition systems thus arises - roughly speaking - as the result of bootstrapping state to that algebra. Finally, we generalize feedback categories endowing state spaces with extra structure: this extends the framework from mere transition systems to automata with initial and final states.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。