论Kleisli提升与装饰迹语义
On Kleisli liftings and decorated trace semantics
AI总结:
本文为条件转换系统建立基于语言与就绪等价的装饰迹语义,通过将CTSs建模为相对单子的Kleisli范畴中的余代数,将Kleisli提升问题归约为经典概念,并基于索引范畴给出一般自函子的构造方法。
摘要:
众所周知,Kleisli范畴为建模副作用提供了一种自然语言。例如,在余代数理论中,当非确定性自动机被建模为幂集单子的Kleisli范畴中的余代数时,行为等价与语言等价(而非互模拟等价)相一致。本文旨在为带/不带升级的条件转换系统(CTSs)建立基于语言等价和就绪等价的装饰迹语义。为此,我们将CTSs建模为相对单子的Kleisli范畴中的余代数。我们的结果有两方面:首先,我们将相对单子背景下机器自函子的Kleisli提升问题归约为经典的Kleisli提升概念;其次,我们提供了一种基于索引范畴的构造方法,用于一般自函子的Kleisli提升。
英文摘要:
It is well known that Kleisli categories provide a natural language to model side effects. For instance, in the theory of coalgebras, behavioural equivalence coincides with language equivalence (instead of bisimilarity) when nondeterministic automata are modelled as coalgebras living in the Kleisli category of the powerset monad. In this paper, our aim is to establish decorated trace semantics based on language and ready equivalences for conditional transition systems (CTSs) with/without upgrades. To this end, we model CTSs as coalgebras living in the Kleisli category of a relative monad. Our results are twofold. First, we reduce the problem of defining a Kleisli lifting for the machine endofunctor in the context of a relative monad to the classical notion of Kleisli lifting. Second, we provide a recipe based on indexed categories to construct a Kleisli lifting for general endofunctors.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。