Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Journal of the ACM (JACM)
Concurrent bisimulations in Petri nets
Acta Informatica
Maximality preserving bisimulation
Theoretical Computer Science
Bisimulation and action refinement
Selected papers of the 3rd workshop on Concurrency and compositionality
Journal of the ACM (JACM)
Theoretical Computer Science - Special volume on Petri nets
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Specifying the ODP Trader: An Introduction to E-LOTOS
FORTE X / PSTV XVII '97 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (PSTV XVII)
Deciding History Preserving Bisimilarity
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Category Theory and Computer Science
Weak Bisimulation and Open Maps
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science
Theoretical Computer Science - Selected papers of CMCS'03
Bisimulations up-to for the linear time branching time spectrum
CONCUR 2005 - Concurrency Theory
Bisimulation on speed: a unified approach
Theoretical Computer Science
Weak Bisimulation for Action-Type Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Simulations Up-to and Canonical Preorders
Electronic Notes in Theoretical Computer Science (ENTCS)
Constrained Simulations, Nested Simulation Semantics and Counting Bisimulations
Electronic Notes in Theoretical Computer Science (ENTCS)
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Logics for contravariant simulations
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
| Hi-index | 0.00 |
Bisimulation semantics are a very pleasant way to define the semantics of systems, mainly because the simplicity of their definitions and their nice coalgebraic properties. However, they also have some disadvantages: they are based on a sequential operational semantics defined by means of an ordinary transition system, and in order to be bisimilar two systems have to be "too similar". In this work we will present several natural proposals to define weaker bisimulation semantics that we think properly capture the desired behaviour of distributed systems. The main virtue of all these semantics is that they are real bisimulation semantics, thus inheriting most of the good properties of bisimulation semantics. This is so because they can be defined as particular instances of Jacobs and Hughes' categorical definition of simulation, which they have already proved to satisfy all those properties.