Mario Román

Home

❯

notes

❯

pieces

❯

Bisimulation

Bisimulation

Apr 29, 20251 min read

  • index

index

  • Simulation simplifies bisimulation
  • Closure of simulation relation
  • Quotient transition system
  • surjections of automata are quotients

References

  • A New Equivalence Notion for Communicating Systems (Park, 1981)
  • Concurrency on Automata and Infinite Sequences (Park, 1981)
  • An Algebraic Definition of Simulation Between Programs (Milner, 1970)
  • On the Origins of Bisimulation and Coinduction (Sangiorgi, 2009)

Flavours of bisimulation.

  • Bisimulation for Labelled Markov Processes (Blute, Desharnais, Edalat, Panangaden, 1997), for probability.

Graph View

Backlinks

  • Closure of simulation relation
  • Probabilistic bisimulation
  • Quotient of IO transition systems
  • Quotient transition system
  • Simulation simplifies bisimulation
  • arbitrary morphisms do not imply bisimulation
  • bisimulation in string diagrams
  • quotients and relations
  • simulation equivalence does not imply bisimulation
  • trace equivalence versus bisimulation

Mario Román, CC-BY-SA. Built with Quartz © 2025.

  • GitHub
  • ArXiv
  • OrcID