Abstract
An alternative proof (to that from [3]) is presented for weak bisimilarity of transition systems to be abstractly definable by open maps [9]. This result arises from an observation that the categories (of transition systems) well suited for studying strong and weak bisimulations are related by an adjunction (for a suitable monad), giving a link between both bisimilarities.We formulate a generalization of this result, hopefully applicable also to other equivalences of processes.
Cite
CITATION STYLE
Lasota, S. (1998). Weak bisimilarity and open maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1521, pp. 381–388). Springer Verlag. https://doi.org/10.1007/3-540-49477-4_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
