公理化最大进展与离散时间
Axiomatizing Maximal Progress and Discrete Time
AI总结:
本文针对带优先级和递归的基本进程代数,引入辅助算子pri(E)定义优先级作用域,解决了用标准观察同余公理化优先级这一长期未决问题,并给出了完备公理化,且扩展至离散时间演算的有限状态项。
摘要:
Milner关于观察同余的完备证明系统,其关键基础在于通过公理 $recX. (τ.X + E) = recX. τ. E$ 能够将 $τ$ 发散表达式等价于非发散表达式。然而,在存在优先级概念的情况下(例如,$δ$ 类型动作的优先级低于静默 $τ$ 动作),该公理不再成立。这种优先级形式在定时进程代数中很常见,其中由于 $δ$ 被解释为时间延迟,它自然地从最大进展假设中产生。本文提出了我们的解决方案,通过引入辅助算子 $pri(E)$ 来定义“优先级作用域”,以解决长期未决的、使用标准观察同余对优先级进行公理化的问题:我们为带有优先级和(无保护)递归的基本进程代数提供了完备的公理化。我们还表明,当通过考虑离散时间演算的静态算子来扩展该设置时,可以通过重用与Jos Baeten教授合作期间开发的技术,构建一个在有限状态项(的特征刻画)上完备的公理化。
英文摘要:
Milner's complete proof system for observational congruence is crucially based on the possibility to equate $τ$ divergent expressions to non-divergent ones by means of the axiom $recX. (τ.X + E) = recX. τ. E$. In the presence of a notion of priority, where, e.g., actions of type $δ$ have a lower priority than silent $τ$ actions, this axiom is no longer sound. Such a form of priority is, however, common in timed process algebra, where, due to the interpretation of $δ$ as a time delay, it naturally arises from the maximal progress assumption. We here present our solution, based on introducing an auxiliary operator $pri(E)$ defining a "priority scope", to the long time open problem of axiomatizing priority using standard observational congruence: we provide a complete axiomatization for a basic process algebra with priority and (unguarded) recursion. We also show that, when the setting is extended by considering static operators of a discrete time calculus, an axiomatization that is complete over (a characterization of) finite-state terms can be developed by re-using techniques devised in the context of a cooperation with Prof. Jos Baeten.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。