Robustness of a bisimulation-type faster-than preorder

Details Robustness of a bisimulation-type faster-than preorder Robustness of a bisimulation-type faster-than preorder

2009-11-15

arxiv.org/abs/0911.2760v1

EPTCS 8, 2009, pp. 66-79

Computer Science

Logic in Computer Science

Express Workshop

Scientific paper

10.4204/EPTCS.8.6

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.

Affiliated with

Also associated with

No associations

Rating

Robustness of a bisimulation-type faster-than preorder does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Robustness of a bisimulation-type faster-than preorder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robustness of a bisimulation-type faster-than preorder will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-323472