graph: list the transition graph of an agent
Simple-mindedly, and not particularly efficiently, calculates the whole
transition graph of the agent. You do not want to do this for large agents,
let alone infinite ones!
Because of a feature of how graphs are calculated and stored, internal
actions don't show what communication they come from (in CCS, you see tau,
never tau<a>). Use "transitions" to get this information when you want it.
Edinburgh Concurrency Workbench (v7.1).
Page generated: Sun Jul 18 17:51:30 BST 1999