存在中间终止时的顺序合成（扩展摘要）
Sequential Composition in the Presence of Intermediate Termination (Extended Abstract)
摘要：
顺序组合操作符的标准操作语义在按顺序放置透明流程表达式时会导致无限分支和遗忘。由于透明性，上下文无关和下推过程之间的对应关系无法进行模双相似性，并且不清楚如何指定总是终止的半计数器。我们提出了一个修订后的操作语义的顺序组合操作符的上下文中的中间终止。与修订后的操作语义，我们消除了透明度，使我们能够建立一个上下文无关的进程和下推进程之间的密切联系。此外，我们证明了反应图灵功能的TCP与迭代和嵌套的顺序组合的修订操作语义。
英文摘要：
The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequence. Due to transparency, the correspondence between context-free and pushdown processes fails modulo bisimilarity, and it is not clear how to specify an always terminating half counter. We propose a revised operational semantics for the sequential composition operator in the context of intermediate termination. With the revised operational semantics, we eliminate transparency, allowing us to establish a close correspondence between context-free processes and pushdown processes. Moreover, we prove the reactive Turing powerfulness of TCP with iteration and nesting with the revised operational semantics for sequential composition.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
