I've been working on this for a bit, and I've run into some issues. In order to figure out whether a call sequence is permitted, we need to execute calls on the gossip graph. However, this turns out to be somewhat tricky due to an earlier design decision: namely representing bidirectional relations only on one of both agents. This makes rendering easier, but now turns out to make performing calls a lot harder.
Since I am planning to refactor the graph parsing ( #21 ), I might reverse this decision and just deal with a transformation on the graph before rendering.
I've been working on this for a bit, and I've run into some issues. In order to figure out whether a call sequence is permitted, we need to execute calls on the gossip graph. However, this turns out to be somewhat tricky due to an earlier design decision: namely representing bidirectional relations only on one of both agents. This makes rendering easier, but now turns out to make performing calls a lot harder.
Since I am planning to refactor the graph parsing ( #21 ), I might reverse this decision and just deal with a transformation on the graph before rendering.