Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Action versus state based logics for transition systems
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
An action-based framework for verifying logical and behavioural properties of concurrent systems
Computer Networks and ISDN Systems - Special issue on tools for FDTs
Three logics for branching bisimulation
Journal of the ACM (JACM)
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Model Checking Under Generalized Fairness Constraints
Model Checking Under Generalized Fairness Constraints
Branching Bisimilarity with Explicit Divergence
Fundamenta Informaticae
Folk theorems on the correspondence between state-based and event-based systems
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Folk theorems on the correspondence between state-based and event-based systems
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
| Hi-index | 0.00 |
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.