play: play strong bisimulation games



Temporarily unavailable, sorry: being fitted into more general framework.

Finds a winning strategy for strong bisimulation game starting from (A,B) and plays it against you. Note that this game based algorithm is much less space efficient than the partitioning algorithm used by strongeq, so you should only use it when you want to play games. (This could be fixed.)

Would it be useful if it did more flexible things, like letting you take the winning side? Please tell us.

See also

  • strongeq
    Edinburgh Concurrency Workbench (v7.1). Page generated: Sun Jul 18 11:46:51 BST 1999