Changes between Version 26 and Version 27 of ReferenceNetsReachabilityGraph

Timestamp:

Jun 3, 2019, 4:49:08 PM (6 years ago)

Author:

9simon

Comment:

A More Complex Example: reword.

ReferenceNetsReachabilityGraph

@@ -108 +108 @@
 
 === The Reachability Graph
-As expected, the internal states of the clock lead to an significantly increasing amount of distinct markings.
-This is even with the limitation of only a single clock instance at a time and the consumer not storing the clocks.
-Still, the reachability graph becomes extremely harder to read for the human eye, even with proper formatting of the graph.
+As expected, the internal state of the clock leads to a significantly increased amount of distinct markings.
+This is even the case with only a single clock instance at a time that is not stored by the consumer.
+Still, the reachability graph becomes extremely hard to read for the human eye, even with proper formatting of the graph.
 
 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 markings.
-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.
-It is important to remain the flexibility to flag only certain subnets, since in many cases, some subnets should appear fully in the reachability graph, while some should not.
+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 node.
+It is important to maintain the flexibility to flag only certain subnets, since in many cases, some subnets' behavior should be fully represented in the reachability graph, while other's should not.