Communicating sequential processes
Communicating sequential processes
Algebraic theory of processes
Communication and concurrency
Handbook of logic in computer science (vol. 4)
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Open maps as a bridge between algebraic observational equivalence and bisimilarity
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Presheaf Models for Concurrency
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Behavioural Satisfaction and Equivalence in Concrete Model Categories
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Open Maps, Behavioural Equivalences, and Congruences
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
| Hi-index | 0.00 |
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.