期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2009
卷号：8
页码：66-80
DOI：10.4204/EPTCS.8.6
出版社：Open Publishing Association
摘要：TACS is an extension of CCS where upper time bounds for delays can be specified. Luettgen and Vogler defined three variants of bismulation-type faster-than relations and showed that they all three lead to the same preorder, demonstrating the robustness of their approach. In the present paper, the operational semantics of TACS is extended; it is shown that two of the variants still give the same preorder as before, underlining robustness. An explanation is given why this result fails for the third variant. It is also shown that another variant, which mixes old and new operational semantics, can lead to smaller relations that prove the same preorder.
