Bisimulations and abstraction homomorphisms
Proc. of the international joint conference on theory and practice of software development (TAPSOFT) Berlin, March 25-29, 1985 on Mathematical foundations of software development, Vol. 1: Colloquium on trees in algebra and programming (CAAP'85)
Journal of the ACM (JACM)
Bisimulation through probabilistic testing
Information and Computation
Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
Fuzzy Sets and Systems - Special issue on fuzzy relations, part 1
A complete axiomatization of timed bisimulation for a class of timed regular behaviours
Theoretical Computer Science
Algebra of programming
Heterogeneous relation algebra
Relational methods in computer science
Relators and metric bisimulations (abstract only)
Theoretical Computer Science
Communication and Concurrency
On the Proof Method for Bisimulation (Extended Abstract)
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Goguen Categories: A Categorical Approach to L-fuzzy Relations
Goguen Categories: A Categorical Approach to L-fuzzy Relations
Hi-index | 0.00 |
In this paper we develop an algebraic/categorical theory of bisimulations using relational methods. We define a general notion, which is capable of handeling different version of bisimilarity in a common context. Furthermore, the approach relates bisimulations with the notion of a covering known from the theory of graphs and their applications in topology and complex analysis.