In the context of Petri nets, a second diagram type is needed to describe the reachability of states within a Petri net. A reachability graph is a simple graph consisting of nodes containing a numeric vector (comma separated list) connected by simple arrows. No multiplicities are needed, but instead, an annotation of the arrows should be possible to show which transition caused the state change. The start state is marked by an arrow pointing to the node representing the start state. Since dangling arrows are probably difficult to realize using drawing tools, I suggest implementing this as an attribute (checkbox) of the nodes.
Describe the solution you'd like
Create a new diagram type for reachability graphs. I suggest using activity diagrams as a baseline and only use the action node type.
Is your feature request related to a problem?
In the context of Petri nets, a second diagram type is needed to describe the reachability of states within a Petri net. A reachability graph is a simple graph consisting of nodes containing a numeric vector (comma separated list) connected by simple arrows. No multiplicities are needed, but instead, an annotation of the arrows should be possible to show which transition caused the state change. The start state is marked by an arrow pointing to the node representing the start state. Since dangling arrows are probably difficult to realize using drawing tools, I suggest implementing this as an attribute (checkbox) of the nodes.
Describe the solution you'd like
Create a new diagram type for reachability graphs. I suggest using activity diagrams as a baseline and only use the action node type.