Changes between Version 28 and Version 29 of ReferenceNetsReachabilityGraph

Timestamp:

Jun 3, 2019, 4:58:29 PM (6 years ago)

Author:

9simon

Comment:

ReferenceNetsReachabilityGraph without link

ReferenceNetsReachabilityGraph

@@ -1 @@
-**ReferenceNetsReachabilityGraph**
+= ReferenceNetsReachabilityGraph
 
 == Examples for the Reference Net Reachability Graph Plugin
@@ -39 +39 @@
 
 For every distinct state of the root net there is a node in the reachability graph. 
-While common algorithms that create reachability graphs terminate in this case, the ReferenceNetsReachabilityGraph Plugin does not contain a comparison of markings yet.
+While common algorithms that create reachability graphs terminate in this case, the !ReferenceNetsReachabilityGraph Plugin does not contain a comparison of markings yet.
 Consequently, if any net contains an unbounded place, an infinite amount of nodes are created in the reachability graph.
 To illustrate, the previous example has been modified to include a place, which counts how many times the resource in the reader/writer problem has been accessed.
@@ -74 +74 @@
 [[Image(prodcons-complete.png, 95%)]]
 
-The ReferenceNetsReachabilityGraph Plugin is started with the system net as the root net.
+The !ReferenceNetsReachabilityGraph Plugin is started with the system net as the root net.
 As the synchronous calls are initiated from the system net, they are listed without a prefix.
 The internal marking changes of the producer/consumer have the net instance ID as prefix.