Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract)
Quiescence, Fairness, Testing, and the Notion of Implementation (Extended Abstract)
复制标题
静止、公平、测试和实现的概念（扩展摘要）
DOI：
10.1007/3-540-57208-2_23
复制
发表时间：
1993
影响因子：
5
通讯作者：
R. Segala
中科院分区：
文献类型：
--
作者：
R. Segala
本文比较了两种不同的并发形式，并说明它们具有共同的基础。在过渡系统的框架下，分析了输入/输出自动机模型和测试理论。研究了I/O自动机的公平预定和静态预定之间的关系，并证明了这两种预定在一大类自动机上是重合的。将I/O自动机编码到测试理论中，对于强收敛的有限分支自动机，反向MUST预序被证明与静态预序等效。相反，在I/O自动机上直接定义了测试理论，并且在强收敛的有限分支自动机上，新的反转MUST预序与静态预序一致。最后，对发散问题和其他现有的I/O区分理论进行了一些考虑。
Two different formalisms for concurrency are compared and are shown to have common foundations. The Input/Output automaton model and the theory of testing are analyzed in the framework of transition systems. The relationship between the fair and quiescent preorders of I/O automata is investigated and the two preorders are shown to coincide on a large class of automata. I/O automata are encoded into the theory of testing and the reversed MUST preorder is shown to be equivalent to the quiescent preorder for strongly convergent, finitely branching automata up to encoding. Conversely, a theory of testing is defined directly on I/O automata, and the new reversed MUST preorder is shown to coincide with the quiescent preorder on strongly convergent, finitely branching automata. Finally, some considerations are given on the issue of divergence, and on other existing theories with an I/O distinction.