Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Bisimulation through probabilistic testing
Information and Computation
A framework based on implementation relations for implementing LOTOS specifications
Computer Networks and ISDN Systems
Structured operational semantics and bisimulation as a congruence
Information and Computation
Journal of the ACM (JACM)
Conformance testing with labelled transition systems: implementation relations and test generation
Computer Networks and ISDN Systems - Special issue on protocol testing
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Category Theory and Computer Science
Theoretical Computer Science - Selected papers of CMCS'03
Similarity quotients as final coalgebras
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
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
Relating modal refinements, covariant-contravariant simulations and partial bisimulations
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Hi-index | 0.00 |
We present a study of the notion of coalgebraic simulation introduced by Hughes and Jacobs. Although in their original paper they allow any functorial order in their definition of coalgebraic simulation, for the simulation relations to have good properties they focus their attention on functors with orders which are strongly stable. This guarantees a so-called "composition-preserving" property from which all the desired good properties follow. We have noticed that the notion of strong stability not only ensures such good properties but also "distinguishes the direction" of the simulation. For example, the classic notion of simulation for labeled transition systems, the relation "p is simulated by q", can be defined as a coalgebraic simulation relation by means of a strongly stable order, whereas the opposite relation, "p simulates q", cannot. Our study was motivated by some interesting classes of simulations that illustrate the application of these results: covariant-contravariant simulations and conformance simulations.