Differences

This shows you the differences between two versions of the page.

--- 01_user_documentation:06_graph:05_derivation:04_modes:02_parallel_non_deterministic_mode [2025/12/17 12:32] – Tim
+++ 01_user_documentation:06_graph:05_derivation:04_modes:02_parallel_non_deterministic_mode [2025/12/17 12:40] (current) – Tim
@@ Line 3: / Line 3: @@
 The parallel non-deterministic derivation mode ensures that a single node is deleted by at most one actual rule application. If several rule applications delete the same node, one actual application is chosen pseudo-randomly.
+====== ======
+Assuming to apply a rule set:
+<code>
+ A ==> B A
+ A ==> C A
+ A ==> A A
+</code>
+on an axiom ''A''
+could result after two steps in:
+  * ''BBA''
+  * ''CCA''
+  * ''AAA''
+  * ''BAA''
+  * ''CBA''
+  * ...
+Because at any step the software pics randomly one of the possible rules for A and applies it.