Projects



Changes between Version 2 and Version 3 of ReferenceNetsReachabilityGraph


Ignore:
Timestamp:
Apr 26, 2019, 7:17:32 PM (6 years ago)
Author:
5willrod
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • ReferenceNetsReachabilityGraph

    v2 v3  
    11**ReferenceNetsReachabilityGraph**
    22
     3== Examples for the Reference Net Reachability Graph Plugin
     4
     5=== Nets without subnets
     6
     7The following example shows a simple reference net without any subnets.
     8The reachability graph is generated as expected, with the red node representing the initial marking and any other node representing a reachable marking of the net.
     9The arrows are labeled with the respective transition that fired. This can be further extended, so that any arrow instead is labeled with the full binding of the firing.
     10
     11=== Example
     12
     13[[Image(rw-net.pdf)]]
    314[[Image(rw-rggraph.pdf)]]
     15
     16A reference net modeling the reader writer problem with two persons and the generated reachability graph. Black tokens are noted as [] .
     17
     18== Depth limited search
     19
     20If desired, the Reference Net Reachability Graph Plugin can generate the reachability graph only up to a specified depth.
     21The following example shows the same net of the prior example, generated with a depth limit of 1.
     22Here, all markings that can be reached by firing one transition are fully explored.
     23All further bindings that the simulation finds are listed, but not explored.
     24These special unexplored markings are represented by a triangular node.
     25Note that it is possible that an unexplored marking could be identical to one of the already explored markings in the graph.
     26As the markings are not explored however, they are not summarized to one marking.
     27
     28=== Example
     29
     30[[Image(rw-net.pdf)]]
     31[[Image(rw-rggraph-depthlimit.pdf)]]
     32
     33The same net as before, this time with a depth limit.
     34Possible, but not explored bindings are represented with a triangular node.
     35Bindings of unexecuted bindings are still listed, as can be seen on the lower left arrow inscription.
     36
     37== Nets with subnets
     38
     39The previous example displayed the reachability graph only for a single net without reference to other nets.
     40For the inspection of more complicated and nested nets, we turn off the node inscriptions of the reachability graph and instead explore it interactively.
     41
     42Any node represents the root net instance with a certain marking.
     43They can be expanded, which will open a copy of the root net instance in this particular state.
     44This net instance behaves like a simulation step which can be fully explored, meaning that all nets that this net has a reference of can be explored with their current marking, including, again, nets referenced in this net.
     45
     46For any firing that happens within a subnet, the arrow is labeled with the identifier of the subnet proceeding the transition identifier, whereas transitions in the root net are only labeled with their identifier.
     47
     48=== Example 1
     49
     50=== Example 2
     51