Folk Theorems on the Correspondence between State-Based and Event-Based Systems

Details Folk Theorems on the Correspondence between State-Based and Event-Based Systems Folk Theorems on the Correspondence between State-Based and Event-Based Systems

2010-10-31

arxiv.org/abs/1011.0136v1

Computer Science

Logic in Computer Science

Full version of SOFSEM 2011 paper

Scientific paper

Kripke Structures and Labelled Transition Systems are the two most prominent semantic models used in concurrency theory. Both models are commonly believed to be equi-expressive. One can find many ad-hoc embeddings of one of these models into the other. We build upon the seminal work of De Nicola and Vaandrager that firmly established the correspondence between stuttering equivalence in Kripke Structures and divergence-sensitive branching bisimulation in Labelled Transition Systems. We show that their embeddings can also be used for a range of other equivalences of interest, such as strong bisimilarity, simulation equivalence, and trace equivalence. Furthermore, we extend the results by De Nicola and Vaandrager by showing that there are additional translations that allow one to use minimisation techniques in one semantic domain to obtain minimal representatives in the other semantic domain for these equivalences.

Affiliated with

Also associated with

No associations

Rating

Folk Theorems on the Correspondence between State-Based and Event-Based Systems 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 Folk Theorems on the Correspondence between State-Based and Event-Based Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Folk Theorems on the Correspondence between State-Based and Event-Based Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-663496