Relating Modal Refinements, Covariant-Contravariant Simulations and Partial Bisimulations
This paper studies the relationships between three notions of behavioural preorder that have been proposed in the literature: refinement over modal transition systems, and the covariant-contravariant simulation and the partial bisimulation preorders over labelled transition systems. It is shown that there are mutual translations between modal transition systems and labelled transition systems that preserve, and reflect, refinement and the covariant-contravariant simulation preorder. The translations are also shown to preserve the modal properties that can be expressed in the logics that characterize those preorders. A translation from labelled transition systems modulo the partial bisimulation preorder into the same model modulo the covariant-contravariant simulation preorder is also offered, together with some evidence that the former model is less expressive than the latter. In order to gain more insight into the relationships between modal transition systems modulo refinement and labelled transition systems modulo the covariant-contravariant simulation preorder, their connections are also phrased and studied in the context of institutions.
KeywordsModal Logic Transition System Supervisory Control Label Transition System Modal Formula
Unable to display preview. Download preview PDF.
- 2.Baeten, J., van Beek, D., Luttik, B., Markovski, J., Rooda, J.: Partial bisimulation. SE Report 2010-04, Systems Engineering Group, Department of Mechanical Engineering, Eindhoven University of Technology (2010)Google Scholar
- 4.Darondeau, P., Dubreil, J., Marchand, H.: Supervisory control for modal specifications of services. In: Proceedings of WODES 2010, Berlin, Germany, August 30–September 1 (2010) (to appear)Google Scholar
- 12.Larsen, K.G., Thomsen, B.: A modal process logic. In: Proceedings of 3rd Annual Symposium on Logic in Computer Science, Edinburgh, pp. 203–210. IEEE Computer Society Press (1988)Google Scholar