Robustness of a bisimulation-type faster-than preorder

Katrin Iltgen
(Universität Augsburg)
Walter Vogler
(Universität Augsburg)

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.

In Sibylle Fröschle and Daniele Gorla: Proceedings 16th International Workshop on Expressiveness in Concurrency (EXPRESS 2009), Bologna, Italy, 5th September 2009, Electronic Proceedings in Theoretical Computer Science 8, pp. 66–80.
Published: 17th November 2009.

ArXived at: bibtex PDF

Comments and questions to:
For website issues: