Changes between Version 22 and Version 23 of ReferenceNetsReachabilityGraph

Timestamp:

Jun 3, 2019, 3:37:55 PM (6 years ago)

Author:

9simon

Comment:

british -> american

ReferenceNetsReachabilityGraph

@@ -50 +50 @@
 As a result of the newly introduced place, a chain of nodes emerge in the reachability graph, wherein each cycle in the root net results in an additional token in the reachability graph. 
 So although only one place in the net accumulates tokens and the possible transition sequences are irrelevant to the number of tokens in that place, the resulting reachability graph gets infinitely more nodes. 
-It is still possible to visualise a portion of it by setting a depth limit for exploration. 
-However, a better approach to visualise these kinds of state spaces would be the coverability graph, which may come in a later update.
+It is still possible to visualize a portion of it by setting a depth limit for exploration. 
+However, a better approach to visualize these kinds of state spaces would be the coverability graph, which may come in a later update.
 
 == Nets with subnets
@@ -110 +110 @@
 Still, the reachability graph becomes extremely harder to read for the human eye, even with proper formatting of the graph.
 
-However, the complexity of the actual system that is being modelled did not really increase and is, in fact, still easy to describe in words.
+However, the complexity of the actual system that is being modeled did not really increase and is, in fact, still easy to describe in words.
 A proposed solution to this discrepancy is the feature to abstract certain nets or parts of their states.
 The result is a folded reachability graph, where nodes that only differ in a marking of places that are flagged as "ignore" are folded into a single place.