Reverse Bisimulations on Stable Configuration Structures

Details Reverse Bisimulations on Stable Configuration Structures Reverse Bisimulations on Stable Configuration Structures

2010-02-15

arxiv.org/abs/1002.2871v1

EPTCS 18, 2010, pp. 62-76

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.18.5

The relationships between various equivalences on configuration structures, including interleaving bisimulation (IB), step bisimulation (SB) and hereditary history-preserving (HH) bisimulation, have been investigated by van Glabbeek and Goltz (and later Fecher). Since HH bisimulation may be characterised by the use of reverse as well as forward transitions, it is of interest to investigate forms of IB and SB where both forward and reverse transitions are allowed. We give various characterisations of reverse SB, showing that forward steps do not add extra power. We strengthen Bednarczyk's result that, in the absence of auto-concurrency, reverse IB is as strong as HH bisimulation, by showing that we need only exclude auto-concurrent events at the same depth in the configuration.

Affiliated with

Also associated with

No associations

Rating

Reverse Bisimulations on Stable Configuration Structures 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 Reverse Bisimulations on Stable Configuration Structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reverse Bisimulations on Stable Configuration Structures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-146085