Let M be a system (possibly proper class-sized directed graph where the class of children of a given node is a set). A binary relation R on M is a BISIMULATION if [tex]R\subset R'[/tex], where for [tex]a, b\in M[/tex](adsbygoogle = window.adsbygoogle || []).push({});

[tex]aR'b \Leftrightarrow ((\forall x \in a_M\exists y\in b_M xRy) \wedge (\forall x \in b_M\exists y\in a_M xRy))[/tex]

where [tex]a_M[/tex] is the set of children of a in M.

So let ~ be the relation on the class of all sets V such that a~b iff there exists an accessible pointed graph that is the picture of both a and b.

An accessible pointed graph is a directed graph with a distinguished node from where every other node is connected by a path.

Show that ~ is a bisimulation.

I'm not sure what bisimulation says. Can someone explain it in more familiar terms?

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# How to determine if a binary relation R on M is a bisimulation?

Loading...

Similar Threads - determine binary relation | Date |
---|---|

I How do I determine if improving a fit is significant? | Feb 10, 2018 |

I How to determine energy savings from weather and usage data | Jun 9, 2017 |

B How to determine when to take a bet? | Apr 13, 2017 |

B Not sure what this problem would be called... | Apr 4, 2017 |

Determining Specifics of 20:80 Rule (Pareto) | Feb 2, 2016 |

**Physics Forums - The Fusion of Science and Community**