diff --git a/models/Application_examples/Agile_Production_Platform_Customer_Interactions.mp b/models/Application_examples/Agile_Production_Platform_Customer_Interactions.mp
index 6a5b45e7b3ccef3d7cefc9c324444e206671f311..fd755a1a97f173236ba0d6e8af1c22f522b2ef7b 100644
--- a/models/Application_examples/Agile_Production_Platform_Customer_Interactions.mp
+++ b/models/Application_examples/Agile_Production_Platform_Customer_Interactions.mp
@@ -18,7 +18,7 @@
│*│ │ Platform" (APP). Here the order is for face │ │
│*│ │ shields in response to the COVID-19 pandemic. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates using MP to find both │ │
│*│ │ desired and undesired scenarios of Personal │ │
diff --git a/models/Application_examples/Agile_Production_Platform_Supply_Chain_Interaction.mp b/models/Application_examples/Agile_Production_Platform_Supply_Chain_Interaction.mp
index 216843c26723a097aeac17c979d86432f2bd22d0..89526e27183c3d482a4077361ce28fde199bdaf1 100644
--- a/models/Application_examples/Agile_Production_Platform_Supply_Chain_Interaction.mp
+++ b/models/Application_examples/Agile_Production_Platform_Supply_Chain_Interaction.mp
@@ -15,7 +15,7 @@
│*│ │ material on-hand to produce the component │ │
│*│ │ correctly. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates using MP to find both │ │
│*│ │ desired and undesired scenarios resulting from │ │
diff --git a/models/Application_examples/Application_Process.mp b/models/Application_examples/Application_Process.mp
index c4303426ac91a7508b1984ce95865d499b8f51ce..45c77418a63ce74458bb8b1bd24f67088a3af572 100644
--- a/models/Application_examples/Application_Process.mp
+++ b/models/Application_examples/Application_Process.mp
@@ -9,7 +9,7 @@
│*│ │ To provide a template for an application approval │ │
│*│ │ process involving multiple levels of approval. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ An applicant submits application and needs to get │ │
│*│ │ it approved by the bureaucratic chain of two │ │
diff --git a/models/Application_examples/Aspect_Oriented_Paradigm.mp b/models/Application_examples/Aspect_Oriented_Paradigm.mp
index 787510eb6fdad6969a7bf5cad9619d7e85edc17b..192a503b26173ba12454808397d2d986775d1f0a 100644
--- a/models/Application_examples/Aspect_Oriented_Paradigm.mp
+++ b/models/Application_examples/Aspect_Oriented_Paradigm.mp
@@ -9,7 +9,7 @@
│*│ │ To demonstrate the Aspect-Oriented Programming │ │
│*│ │ paradigm in MP. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ Aspect-Oriented Programming (AOP) [Kiczales et al. │ │
│*│ │ 1997] is a programming approach that separates the │ │
diff --git a/models/Application_examples/Authentication.mp b/models/Application_examples/Authentication.mp
index ebead158e07ddcfb557e702ee8d0cc008891a181..1dd8c28392d91078e54501f7f5c09b827ddeee54 100644
--- a/models/Application_examples/Authentication.mp
+++ b/models/Application_examples/Authentication.mp
@@ -14,7 +14,7 @@
│*│ │ To demonstrate how to reject unwanted behaviors │ │
│*│ │ with ENSURE constraints. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates how to correctly model a │ │
│*│ │ simple user authentication system with ENSURE │ │
diff --git a/models/Application_examples/Autonomous_Car.mp b/models/Application_examples/Autonomous_Car.mp
index eb7aa5b65523fd04cfa7e6d883dd746bb727aac9..744b00135db9b0ed8410ee2ebff3012780476fc2 100644
--- a/models/Application_examples/Autonomous_Car.mp
+++ b/models/Application_examples/Autonomous_Car.mp
@@ -11,7 +11,7 @@
│*│ │ To illustrate the use of COORDINATE statements to │ │
│*│ │ improve the quality of trace analysis. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This is a model of an autonomous car that was │ │
│*│ │ developed as part of a student project to support │ │
diff --git a/models/Application_examples/Beginner_Use_of_MP.mp b/models/Application_examples/Beginner_Use_of_MP.mp
index 71fd1826b216d27c6db761e5732ce345cd46c8df..2d9302a8face04a9d74ecdd1368c4cab5465bab8 100644
--- a/models/Application_examples/Beginner_Use_of_MP.mp
+++ b/models/Application_examples/Beginner_Use_of_MP.mp
@@ -15,7 +15,7 @@
│*│ │ 2) the modeling process of formalizing a previously│ │
│*│ │ unstated assumption. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model provides an orientation for those just │ │
│*│ │ getting started using MP-Firebird. The text editor │ │
@@ -27,12 +27,12 @@
│*│ │ scope slider bar next to the Run button to control │ │
│*│ │ the number of loop iterations. │ │
│*│ │ │ │
-│*│ │ ROOT A: B C; A is a root event that includes │ │
+│*│ │ ROOT A: B C; A is a root event that includes │ │
│*│ │ events B followed by C │ │
│*│ │ ( B | C ) Alternative events B or C (but not │ │
│*│ │ both together in the same trace) │ │
-│*│ │ (* B *) iterate B zero or more times │ │
-│*│ │ { B , C } B and C are unordered │ │
+│*│ │ (* B *) iterate B zero or more times │ │
+│*│ │ { B , C } B and C are unordered │ │
│*│ └────────────────────────────────────────────────────┘ │
│*│ │
│*│ ┌─[ References ]─────────────────────────────────────┠│
diff --git a/models/Application_examples/CargoScreening.mp b/models/Application_examples/CargoScreening.mp
index c1c2633c5b6b347ff62988a7749698d0dc9a9c7d..8bec9d3ccfe82930751a13e7a1c487b214cfe94f 100644
--- a/models/Application_examples/CargoScreening.mp
+++ b/models/Application_examples/CargoScreening.mp
@@ -12,7 +12,7 @@
│*│ │ logic, in this case outlining a cargo screening │ │
│*│ │ process. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates using composite statements │ │
│*│ │ under roots to make a long chain of logic. This │ │
diff --git a/models/Application_examples/Commercial_Flight.mp b/models/Application_examples/Commercial_Flight.mp
index a1a5dc5c580f7b0c9eb4538dd2b1f109738189a5..5da79d3fe8d10e7a6a7b127400bb144d22427442 100644
--- a/models/Application_examples/Commercial_Flight.mp
+++ b/models/Application_examples/Commercial_Flight.mp
@@ -13,7 +13,7 @@
│*│ │ statements to make a web of actions linked │ │
│*│ │ together through phases. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates the interlacing of root │ │
│*│ │ events as Phases and as Actors, in order to model │ │
diff --git a/models/Application_examples/Correlation_and_Fusion_Process_Ungoverned.mp b/models/Application_examples/Correlation_and_Fusion_Process_Ungoverned.mp
index 6f5065f5904ca78215d2f158244b63c876dd24bc..edc3f6d5f2bf17b4c1cb33243c0cb2da51abac41 100644
--- a/models/Application_examples/Correlation_and_Fusion_Process_Ungoverned.mp
+++ b/models/Application_examples/Correlation_and_Fusion_Process_Ungoverned.mp
@@ -11,7 +11,7 @@
│*│ │ reporting data flows showing existing data path │ │
│*│ │ behaviors. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ Models the data flow from sensors all the way to │ │
│*│ │ the human analyst at a tactical location. The │ │
diff --git a/models/Application_examples/Correlation_and_Fusion_Process_with_Data_Governance.mp b/models/Application_examples/Correlation_and_Fusion_Process_with_Data_Governance.mp
index 76d2d94ba37739dc85fc94e502b8f02ccf146ee3..1e1d516b1b4a236df1529307c5c8902b62b20b92 100644
--- a/models/Application_examples/Correlation_and_Fusion_Process_with_Data_Governance.mp
+++ b/models/Application_examples/Correlation_and_Fusion_Process_with_Data_Governance.mp
@@ -12,7 +12,7 @@
│*│ │ data path behaviors with the application of a data │ │
│*│ │ governance framework. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ Models the data flow from sensors all the way to │ │
│*│ │ the human analyst at a tactical location │ │
diff --git a/models/Application_examples/Cycle_Pattern.mp b/models/Application_examples/Cycle_Pattern.mp
index 2c4c4b3312468b83bec9a25d671c080df4681f79..08b28775fa59b32738801ae7a0b744606109fcbe 100644
--- a/models/Application_examples/Cycle_Pattern.mp
+++ b/models/Application_examples/Cycle_Pattern.mp
@@ -12,9 +12,9 @@
│*│ │ can be modeled in MP, and to show how rule-based │ │
│*│ │ comments can be added to the traces. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
-│*│ │ The model below describes a cyclein terms of a │ │
+│*│ │ The model below describes a cycle in terms of a │ │
│*│ │ series of one or more steps, each step either │ │
│*│ │ moving the system "forward" or "backward" as the │ │
│*│ │ process unfolds. "Forward" and "backward" are │ │
diff --git a/models/Application_examples/Dining_Philosophers.mp b/models/Application_examples/Dining_Philosophers.mp
index a00b0328b1293a883dbc3b2ce71d4f4d4b98eba4..efa7e50b4020f60077370a028d0fb7d7f27aad0c 100644
--- a/models/Application_examples/Dining_Philosophers.mp
+++ b/models/Application_examples/Dining_Philosophers.mp
@@ -11,7 +11,7 @@
│*│ │ solving capabilities of MP, using the dining │ │
│*│ │ philosophers problem as the topic. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates using COORDINATE, ENSURE, │ │
│*│ │ and IF statements to come up with an answer to a │ │
diff --git a/models/Application_examples/Elevator.mp b/models/Application_examples/Elevator.mp
index 244dc8ef15f40a58afbf73a26a09a7f8b2c0d1be..62ca21ceff2ecdea1599f1dcd2149ff6b20ac8b5 100644
--- a/models/Application_examples/Elevator.mp
+++ b/models/Application_examples/Elevator.mp
@@ -11,17 +11,17 @@
│*│ │ be beneficial, because it can lead to emergent │ │
│*│ │ behavior showing up in the traces. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This demonstrates the modeling of situations and │ │
│*│ │ consequential events in MP. The pattern is: │ │
│*│ │ │ │
-│*│ │ ( SituationA do_one_thing | │ │
+│*│ │ ( SituationA do_one_thing | │ │
│*│ │ SituationB do_another_thing ) │ │
│*│ │ │ │
│*│ │ in the case of this model, │ │
│*│ │ │ │
-│*│ │ ( Elevator_works_fine Get_Off | │ │
+│*│ │ ( Elevator_works_fine Get_Off | │ │
│*│ │ Emergency_Situation Call_for_help ) │ │
│*│ │ │ │
│*│ │ Ultimately, this is a simple model of an emergency │ │
diff --git a/models/Application_examples/Falcon_9_Launch_with_Gantt.mp b/models/Application_examples/Falcon_9_Launch_with_Gantt.mp
index 2f768c15b8f576f288e5e75f68dbaedece32377c..abd4adb1fd6f1a45e31abcda278d259d1a44061e 100644
--- a/models/Application_examples/Falcon_9_Launch_with_Gantt.mp
+++ b/models/Application_examples/Falcon_9_Launch_with_Gantt.mp
@@ -13,7 +13,7 @@
│*│ │ and first stage booster recover through system │ │
│*│ │ behavior modeling. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ A Falcon 9 Rocket is a two booster stage rocket │ │
│*│ │ that is designed to carry payloads into space │ │
diff --git a/models/Application_examples/FindAdvisor.mp b/models/Application_examples/FindAdvisor.mp
index 630b8cd376886b06c5b7f6d2a95690a097d8aa00..160714757263a9bf1948811db17f6cfff1c54deb 100644
--- a/models/Application_examples/FindAdvisor.mp
+++ b/models/Application_examples/FindAdvisor.mp
@@ -10,7 +10,7 @@
│*│ │ To show that human interaction and organizational │ │
│*│ │ processes can be modeled using MP. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ Alternate behaviors for humans are described in │ │
│*│ │ terms of possible decisions they could make. This │ │
diff --git a/models/Application_examples/First_Responder.mp b/models/Application_examples/First_Responder.mp
index 8a15136245df24267504a96cae6e7922b4ef78df..1593181572747432775f5231c0605ae6e0df4a18 100644
--- a/models/Application_examples/First_Responder.mp
+++ b/models/Application_examples/First_Responder.mp
@@ -12,7 +12,7 @@
│*│ │ administation of a rescue medication (Narcan) to │ │
│*│ │ an overdose victim. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates the administration of │ │
│*│ │ Narcan by bystanders in order to determine the │ │
diff --git a/models/Application_examples/Knapsack_Weight_Limit.mp b/models/Application_examples/Knapsack_Weight_Limit.mp
index 2404923dff01fc060caf9f91613d88d919170692..45d14263b888181667a86df1a8184d0f9f971308 100644
--- a/models/Application_examples/Knapsack_Weight_Limit.mp
+++ b/models/Application_examples/Knapsack_Weight_Limit.mp
@@ -11,7 +11,7 @@
│*│ │ optimal solutions in a certain scope, with a limit │ │
│*│ │ set for the weight of the knapsack. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This is a case of well-known Knapsack Dynamic │ │
│*│ │ Programming Problem. In general it is NP-hard and │ │
diff --git a/models/Application_examples/MP_Architecture_Specification.mp b/models/Application_examples/MP_Architecture_Specification.mp
index 861af2110f49201b3c8b230402b9be70ebba3d7e..7b8edc798d6cfa2e4e41f186ea34fd9e6df19865 100644
--- a/models/Application_examples/MP_Architecture_Specification.mp
+++ b/models/Application_examples/MP_Architecture_Specification.mp
@@ -11,7 +11,7 @@
│*│ │ MP compiler/trace generator components built from │ │
│*│ │ the component behaviors. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates how a user might use an MP │ │
│*│ │ IDE to extract a component diagram from an MP │ │
diff --git a/models/Application_examples/Manufacturing_Process.mp b/models/Application_examples/Manufacturing_Process.mp
index 2ece47e1b8a43dc3c30f57b53731df196138a56c..c8ffe976b06a751bf6e4771985be6a99d726e65e 100644
--- a/models/Application_examples/Manufacturing_Process.mp
+++ b/models/Application_examples/Manufacturing_Process.mp
@@ -10,7 +10,7 @@
│*│ │ To demonstrate a model of a system manufacturing │ │
│*│ │ process. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates application of Monterey │ │
│*│ │ Phoenix Modeling to Manufacturing Product Systems. │ │
diff --git a/models/Application_examples/Martian_Lander.mp b/models/Application_examples/Martian_Lander.mp
index 3699a65f7020880b1c34ba0cc7d9aa92541ee553..8c6fc315a254b9b84d30ff0d45b1a2e6beaa4f87 100644
--- a/models/Application_examples/Martian_Lander.mp
+++ b/models/Application_examples/Martian_Lander.mp
@@ -13,7 +13,7 @@
│*│ │ Lander, which is an example of real-time system │ │
│*│ │ behavior modeling. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ The landing system operates in one of two modes: │ │
│*│ │ normal or emergency. When the system is turned on │ │
@@ -59,14 +59,14 @@
│*│ │ Action Time in ms │ │
│*│ │ RACC 10 │ │
│*│ │ STMR 10 │ │
-│*│ │ ADJM 20 │ │
-│*│ │ TDP 10 │ │
-│*│ │ IEM 10 │ │
-│*│ │ ETC 10 │ │
-│*│ │ IVEL 20 │ │
-│*│ │ IALT 20 │ │
-│*│ │ CKDT 10 │ │
-│*│ │ RRM 10 │ │
+│*│ │ ADJM 20 │ │
+│*│ │ TDP 10 │ │
+│*│ │ IEM 10 │ │
+│*│ │ ETC 10 │ │
+│*│ │ IVEL 20 │ │
+│*│ │ IALT 20 │ │
+│*│ │ CKDT 10 │ │
+│*│ │ RRM 10 │ │
│*│ │ │ │
│*│ │ In summary, this model demonstrates the use of │ │
│*│ │ COORDINATE statements to model the relationships │ │
diff --git a/models/Application_examples/Prisoners_Dilemma.mp b/models/Application_examples/Prisoners_Dilemma.mp
index ad084533da821cfac3a4150b080c7f07b561f50b..437225bf975470f52cd317e97a88141e747465fe 100644
--- a/models/Application_examples/Prisoners_Dilemma.mp
+++ b/models/Application_examples/Prisoners_Dilemma.mp
@@ -11,7 +11,7 @@
│*│ │ To demonstrate using MP to model the logic of a │ │
│*│ │ game scenario. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ Users looking to model exhaustive logical game │ │
│*│ │ scenarios may want to use this model as an │ │
diff --git a/models/Application_examples/Railroad_Crossing_Safety.mp b/models/Application_examples/Railroad_Crossing_Safety.mp
index ab6528407039651965c9559c5033a613fb294bd0..af64619cef94c30d0cf3d4ff79c52f8cba8a8efb 100644
--- a/models/Application_examples/Railroad_Crossing_Safety.mp
+++ b/models/Application_examples/Railroad_Crossing_Safety.mp
@@ -10,7 +10,7 @@
│*│ │ To illustrate timing attribute use in MP, here for │ │
│*│ │ displaying a railroad crossing scenario. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates using BUILD statements to │ │
│*│ │ add time to a model of car and train interactions │ │
diff --git a/models/Application_examples/Replay_Attack.mp b/models/Application_examples/Replay_Attack.mp
index 83a4913977d75efdfc9c862107171b447f2dd58b..73c06714fb3aa107a0f82aa4035d7d09464d6a4a 100644
--- a/models/Application_examples/Replay_Attack.mp
+++ b/models/Application_examples/Replay_Attack.mp
@@ -10,7 +10,7 @@
│*│ │ To illustrate MP modeling of a replay attack │ │
│*│ │ involving data transmission. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates a well known attack │ │
│*│ │ strategy on a communication system. Users may use │ │
diff --git a/models/Application_examples/Small_Package_Delivery.mp b/models/Application_examples/Small_Package_Delivery.mp
index e79412b153ed48dc6ba276c8513699fb054aada1..c44a016bb38c4713d3c3005c15ede22361a0b965 100644
--- a/models/Application_examples/Small_Package_Delivery.mp
+++ b/models/Application_examples/Small_Package_Delivery.mp
@@ -13,7 +13,7 @@
│*│ │ search and rescue scenario and to illustrate the │ │
│*│ │ impacts of overloading constraints in an MP model. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates overusing COORDINATE and │ │
│*│ │ ENSURE statements to create a model of a complex │ │
diff --git a/models/Application_examples/Spent_Fuel_Cooling_and_Cleanup.mp b/models/Application_examples/Spent_Fuel_Cooling_and_Cleanup.mp
index b5721b9cb68ce02fad7aaa7525c9d4076d5db8f7..26b151143209d482da583944d4ffdc3ac5d3e749 100644
--- a/models/Application_examples/Spent_Fuel_Cooling_and_Cleanup.mp
+++ b/models/Application_examples/Spent_Fuel_Cooling_and_Cleanup.mp
@@ -16,7 +16,7 @@
│*│ │ and purification system, specifically a spent │ │
│*│ │ nuclear fuel cooling pool. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates identifying the components │ │
│*│ │ of and interactions among a spent nuclear fuel │ │
diff --git a/models/Application_examples/Spiral_Software_Process.mp b/models/Application_examples/Spiral_Software_Process.mp
index 4b7b291d14ea365e8e032a01faa5ee3d19a45f12..3ceb14aa9d700c92b688002fa206a588518a160f 100644
--- a/models/Application_examples/Spiral_Software_Process.mp
+++ b/models/Application_examples/Spiral_Software_Process.mp
@@ -10,7 +10,7 @@
│*│ │ To illustrate event sharing in order to model the │ │
│*│ │ spiral software development process. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates the usage of shared events │ │
│*│ │ to model the spiral software process to develop a │ │
diff --git a/models/Application_examples/Supply_Chain_with_Two_Cyber_Threats.mp b/models/Application_examples/Supply_Chain_with_Two_Cyber_Threats.mp
index 4fa7d1261600b452a2fda931c359ae3a19a8b24a..ba68f3ab0ed6b95520f5d15ce8eb648089c9d220 100644
--- a/models/Application_examples/Supply_Chain_with_Two_Cyber_Threats.mp
+++ b/models/Application_examples/Supply_Chain_with_Two_Cyber_Threats.mp
@@ -37,7 +37,7 @@
│*│ │ to demonstrate calculating individual and total │ │
│*│ │ risk scores. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates performing detailed risk │ │
│*│ │ analysis on a supply chain potentially affected by │ │
diff --git a/models/Application_examples/Surgery.mp b/models/Application_examples/Surgery.mp
index c742ff89520ab63076ac6466b51f125dc43a36c7..0259f15abea616afa0bb86f532cad4f2af15f98e 100644
--- a/models/Application_examples/Surgery.mp
+++ b/models/Application_examples/Surgery.mp
@@ -11,7 +11,7 @@
│*│ │ involving several actors, including the │ │
│*│ │ environment. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model shows an example of decisions made by a │ │
│*│ │ leader (Physician), a subordinate(s) (Nurse(s)), │ │
diff --git a/models/Application_examples/Swarm_Search_and_Track.mp b/models/Application_examples/Swarm_Search_and_Track.mp
index 516a447ddb5fb91970d413b44ec559c6b2a25e92..eb1df3ef885c89bec3ec18a312ac36c1aceb39bd 100644
--- a/models/Application_examples/Swarm_Search_and_Track.mp
+++ b/models/Application_examples/Swarm_Search_and_Track.mp
@@ -14,7 +14,7 @@
│*│ │ unmanned aerial vehicle scenario involving a │ │
│*│ │ low fuel condition. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model was developed by an NPS student with │ │
│*│ │ UAV operation experience with the intent to │ │
diff --git a/models/Application_examples/Swarm_UAV.mp b/models/Application_examples/Swarm_UAV.mp
index 7354dd9eb6dae323b4bc5da1b491cd4346fc60b3..30cb3d4d96304d8b4cf7ca31099cfd94819f2332 100644
--- a/models/Application_examples/Swarm_UAV.mp
+++ b/models/Application_examples/Swarm_UAV.mp
@@ -22,7 +22,7 @@
│*│ │ are possible to appear within event traces, taking │ │
│*│ │ effect when the scope is increased. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates using iteration to model │ │
│*│ │ multiple unmanned aerial vehicles (UAVs) with │ │
diff --git a/models/Application_examples/Turtles_in_the_Desert.mp b/models/Application_examples/Turtles_in_the_Desert.mp
index d45d70d03093d79944692f16eaa9f376cf8c2dab..72d1c6e6f959de71839322da33c98fd112319b57 100644
--- a/models/Application_examples/Turtles_in_the_Desert.mp
+++ b/models/Application_examples/Turtles_in_the_Desert.mp
@@ -12,7 +12,7 @@
│*│ │ highlighting the benefits of complete example set │ │
│*│ │ generation in MP. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ Three turtles are moving on a desert plain, all in │ │
│*│ │ the same direction. The first has been asked: │ │
diff --git a/models/Application_examples/UAV_Ingress.mp b/models/Application_examples/UAV_Ingress.mp
index f135743ef9ff364ddf4d3572d82e50bc5e3cb43d..fbe3883b6e6a4bdf3704e1c448dc801fdb42e557 100644
--- a/models/Application_examples/UAV_Ingress.mp
+++ b/models/Application_examples/UAV_Ingress.mp
@@ -11,7 +11,7 @@
│*│ │ unmanned aerial vehicle (UAV) launch and ingress │ │
│*│ │ scenario. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model was developed by an NPS student to │ │
│*│ │ specify the ingress phase of a UAV on a │ │
@@ -51,7 +51,7 @@
│*│ ┌─[ Instructions ]───────────────────────────────────┠│
│*│ │ Run for Scope 1. This model contains an unexpected │ │
│*│ │ behavior in which the UAV status is acceptable but │ │
-│*│ │ the operator aborts the ingress (trace 2). │ │
+│*│ │ the operator aborts the ingress (trace 2). │ │
│*│ ├─[ Run Statistics ]─────────────────────────────────┤ │
│*│ │ Scope 1: 2 traces in less than 1 sec. │ │
│*│ └────────────────────────────────────────────────────┘ │
diff --git a/models/Application_examples/UAV_OnStation.mp b/models/Application_examples/UAV_OnStation.mp
index f871719d5144e6c015579719276a5e9a4a9c96a5..d19581bea9a6754484e6db3cb5d24859b8f419d9 100644
--- a/models/Application_examples/UAV_OnStation.mp
+++ b/models/Application_examples/UAV_OnStation.mp
@@ -17,7 +17,7 @@
│*│ │ To illustrate the modeling for system of systems │ │
│*│ │ behaviors that include failure mode scenarios. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This is a model for an Unmanned Aerial Vehicle in │ │
│*│ │ the OnStation Phase of an ISR mission. It │ │
diff --git a/models/Application_examples/Unmanned_Spacecraft_Comms.mp b/models/Application_examples/Unmanned_Spacecraft_Comms.mp
index 41bca243d098d83c94d28048bf7f4634cbbb590b..4f02f0bdffe0af57e58182f00dc8f87b6141f94a 100644
--- a/models/Application_examples/Unmanned_Spacecraft_Comms.mp
+++ b/models/Application_examples/Unmanned_Spacecraft_Comms.mp
@@ -13,7 +13,7 @@
│*│ │ spacecraft docking with the International Space │ │
│*│ │ Station (ISS). │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model describes a spacecraft communication │ │
│*│ │ system that works with the International Space │ │
diff --git a/models/Application_examples/Web_Browser_Formal_Security.mp b/models/Application_examples/Web_Browser_Formal_Security.mp
index 66db6962d145214dc3168694c0f97181de4b0cb8..66d9d57c1cc29e64dadd18c4a66f3a757567f90c 100644
--- a/models/Application_examples/Web_Browser_Formal_Security.mp
+++ b/models/Application_examples/Web_Browser_Formal_Security.mp
@@ -11,7 +11,7 @@
│*│ │ communication involving a bad server and a good │ │
│*│ │ server. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This example borrowed from (Jackson 2019) │ │
│*│ │ demonstrates how MP can check whether Client's web │ │
diff --git a/models/Application_examples/Wide_Range_Search_for_Wreckage_and_Survivors.mp b/models/Application_examples/Wide_Range_Search_for_Wreckage_and_Survivors.mp
index 487622ae7df936ce81e3022071b260895a72d333..ab7a81a08dbdfef611990b596707fd20346bfeb3 100644
--- a/models/Application_examples/Wide_Range_Search_for_Wreckage_and_Survivors.mp
+++ b/models/Application_examples/Wide_Range_Search_for_Wreckage_and_Survivors.mp
@@ -12,7 +12,7 @@
│*│ │ rescue operation with several environmental and │ │
│*│ │ coordination concerns to address. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model represents an operational process for │ │
│*│ │ use as a common baseline against which alternative │ │
diff --git a/models/Application_examples/Work_Productivity.mp b/models/Application_examples/Work_Productivity.mp
index 63dad67156d62251edeabbeeaaa04a6e30af264a..dfdf5df605a71929e438a9a85e6cd49c3ef1b687 100644
--- a/models/Application_examples/Work_Productivity.mp
+++ b/models/Application_examples/Work_Productivity.mp
@@ -10,7 +10,7 @@
│*│ │ To demonstrate how to print all events present in │ │
│*│ │ the trace with timing attributes. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates using MP to show how │ │
│*│ │ visitors can distract workers with stacked time │ │
diff --git a/models/Example01_SimpleMessageFlow_EventCoordination.mp b/models/Example01_SimpleMessageFlow_EventCoordination.mp
index 765f2eb0f08235af4b325a4cf98ab2d6f9c39195..11533a0e2202766f988c5fa9f33c0fc6d006839e 100644
--- a/models/Example01_SimpleMessageFlow_EventCoordination.mp
+++ b/models/Example01_SimpleMessageFlow_EventCoordination.mp
@@ -9,7 +9,7 @@
│*│ │ rules and how to coordinate events from each of │ │
│*│ │ those rules. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ Event grammar rules for each root define the │ │
│*│ │ derivations for event traces. In this case, we │ │
@@ -44,8 +44,8 @@
│*│ │ to view the trace in an activity diagram format. │ │
│*│ ├─[ Run Statistics ]─────────────────────────────────┤ │
│*│ │ Scope 1: 2 traces in less than 1 sec. │ │
-│*│ │ Scope 2: 3 traces in less than 1 sec. │ │
-│*│ │ Scope 3: 4 traces in less than 1 sec. │ │
+│*│ │ Scope 2: 3 traces in less than 1 sec. │ │
+│*│ │ Scope 3: 4 traces in less than 1 sec. │ │
│*│ └────────────────────────────────────────────────────┘ │
└*┴───────────────────────────────────────────────────────*/
diff --git a/models/Example01a_UnreliableMessageFlow_VirtualEvents.mp b/models/Example01a_UnreliableMessageFlow_VirtualEvents.mp
index 0705f59357b73543658c013de4ff88f29d16608c..25b7db857118c7eeec437485b49de581410f59af 100644
--- a/models/Example01a_UnreliableMessageFlow_VirtualEvents.mp
+++ b/models/Example01a_UnreliableMessageFlow_VirtualEvents.mp
@@ -9,7 +9,7 @@
│*│ │ representing the absence or lack of activity, in │ │
│*│ │ this case, the event "does_not_receive." │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model of sending and receiving events │ │
│*│ │ incorporates a possibility that some messages get │ │
diff --git a/models/Example02_DataFlow_EventSharing.mp b/models/Example02_DataFlow_EventSharing.mp
index 56e7f7d4e8938f2a9ac73e4bc2b9a7d6cb934f58..55a0efb4886dd203d0f4fc31b3061697ac0cde89 100644
--- a/models/Example02_DataFlow_EventSharing.mp
+++ b/models/Example02_DataFlow_EventSharing.mp
@@ -8,7 +8,7 @@
│*│ │ To illustrate the representation of data items as │ │
│*│ │ behaviors. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ MP employs the Abstract Data Type (ADT) principle │ │
│*│ │ introduced by Barbara Liskov to represent data │ │
diff --git a/models/Example03_ATMWithdrawal_BehaviorOfEnvironment.mp b/models/Example03_ATMWithdrawal_BehaviorOfEnvironment.mp
index 8fe96b8ff398e7d074a2fb5f4822dc3f9dcad000..9423a089ad754b1a2d856b39e74096d30e7c9f7c 100644
--- a/models/Example03_ATMWithdrawal_BehaviorOfEnvironment.mp
+++ b/models/Example03_ATMWithdrawal_BehaviorOfEnvironment.mp
@@ -8,7 +8,7 @@
│*│ │ To illustrate integrated system and environment │ │
│*│ │ behaviors. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ MP separates models of component behaviors and │ │
│*│ │ component interactions to permit elaboration on │ │
diff --git a/models/Example04_StackBehavior_EnsureCondition.mp b/models/Example04_StackBehavior_EnsureCondition.mp
index dc50faf604e780b0354741f981ba3d80ee28c276..d2fb34987df88fb64f8add2e84e1589c966f7a97 100644
--- a/models/Example04_StackBehavior_EnsureCondition.mp
+++ b/models/Example04_StackBehavior_EnsureCondition.mp
@@ -8,7 +8,7 @@
│*│ │ To demonstrate the use of the ENSURE condition │ │
│*│ │ containing an example Boolean expression. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ The event trace is a set of events and the Boolean │ │
│*│ │ expressions in MP can embrace the traditional │ │
diff --git a/models/Example04a_StackBehavior_UserDefinedRelations.mp b/models/Example04a_StackBehavior_UserDefinedRelations.mp
index 8a5240d5f6acc41109f70fb62f15e662cd79a424..b128cab179965c51b9b34aa34494a5f640327033 100644
--- a/models/Example04a_StackBehavior_UserDefinedRelations.mp
+++ b/models/Example04a_StackBehavior_UserDefinedRelations.mp
@@ -16,7 +16,7 @@
│*│ │ "Paired_with" to show which "push" events are │ │
│*│ │ paired with which "pop" events. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model is an expansion on Example 04. Model of │ │
│*│ │ Stack Behavior. │ │
diff --git a/models/Example04b_QueueBehavior_UserDefinedRelations.mp b/models/Example04b_QueueBehavior_UserDefinedRelations.mp
index 2987fe6beff82ee9a3e10beac6ac6726489dcb6b..34b73923074d93a19eaa9abcc9ead3241d017a65 100644
--- a/models/Example04b_QueueBehavior_UserDefinedRelations.mp
+++ b/models/Example04b_QueueBehavior_UserDefinedRelations.mp
@@ -18,7 +18,7 @@
│*│ │ 4) present the concept of isomorphism with respect │ │
│*│ │ to models in MP. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model is isomorphic to Example 04a. Model of │ │
│*│ │ Stack Behavior. │ │
diff --git a/models/Example05_CarRace_NestedComposition.mp b/models/Example05_CarRace_NestedComposition.mp
index 819854c9bd95502c7f58e68cc78d677b7fb2fb5a..1e367119db56ecfc5d9c555405f1252678e65cc9 100644
--- a/models/Example05_CarRace_NestedComposition.mp
+++ b/models/Example05_CarRace_NestedComposition.mp
@@ -9,7 +9,7 @@
│*│ │ 1) one-to-many event coordination and │ │
│*│ │ 2) trace annotation. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model of a car race ties the number of Cars │ │
│*│ │ in the race to the scope (running at scope 1 will │ │
diff --git a/models/Example06_UnreliableChannel_AssertionChecking.mp b/models/Example06_UnreliableChannel_AssertionChecking.mp
index b35da18a1833b88b796334a1177693ffc99d0665..a9777b7b8c26cf95d3f92c808869494587dd5cee 100644
--- a/models/Example06_UnreliableChannel_AssertionChecking.mp
+++ b/models/Example06_UnreliableChannel_AssertionChecking.mp
@@ -7,7 +7,7 @@
│*│ ┌─[ Purpose ]────────────────────────────────────────┠│
│*│ │ To demonstrate assertion checking with MP. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This is a behavior model of communicating via an │ │
│*│ │ unreliable channel. It is considered isomorphic │ │
diff --git a/models/Example07_UnconstrainedStack_TraceAnnotation.mp b/models/Example07_UnconstrainedStack_TraceAnnotation.mp
index a1d787cc595a7c3271bbbd9026e7e33e858ace92..de0137c66459f52ae4dc9b6061d65b5a83c0bf52 100644
--- a/models/Example07_UnconstrainedStack_TraceAnnotation.mp
+++ b/models/Example07_UnconstrainedStack_TraceAnnotation.mp
@@ -8,7 +8,7 @@
│*│ │ To demonstrate a technique for debugging using │ │
│*│ │ trace annotation. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ Assertion checking with the CHECK clause may be │ │
│*│ │ the simplest and most common tool for finding │ │
diff --git a/models/Example08_EmployeeEmployer_CoordinationAcrossHierarchyLevels.mp b/models/Example08_EmployeeEmployer_CoordinationAcrossHierarchyLevels.mp
index 600d1c607efecb849f87b401ac9f3e653539f13a..090f4aaf5580de237039ae7417b57b0f26dee052 100644
--- a/models/Example08_EmployeeEmployer_CoordinationAcrossHierarchyLevels.mp
+++ b/models/Example08_EmployeeEmployer_CoordinationAcrossHierarchyLevels.mp
@@ -8,7 +8,7 @@
│*│ │ To demonstrate the modeling of a business process │ │
│*│ │ in MP. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ The site http://www.infoq.com/articles/bpelbpm │ │
│*│ │ "Why BPEL is not the holy grail for BPM" provides │ │
diff --git a/models/Example09_CardiacArrestWorkflow_VirtualEvents.mp b/models/Example09_CardiacArrestWorkflow_VirtualEvents.mp
index 72df1808cd0fe8da405624f984aa6a253c37eca2..1bfbdb391a3b3629f3644c40e4781244f6d05510 100644
--- a/models/Example09_CardiacArrestWorkflow_VirtualEvents.mp
+++ b/models/Example09_CardiacArrestWorkflow_VirtualEvents.mp
@@ -7,7 +7,7 @@
│*│ ┌─[ Purpose ]────────────────────────────────────────┠│
│*│ │ To demonstrate the modeling of a workflow in MP. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ When handling a cardiac arrest, the │ │
│*│ │ check_breathing and check_pulse tasks run in │ │
diff --git a/models/Example10_PipeFilter_TraceAnnotationQueries.mp b/models/Example10_PipeFilter_TraceAnnotationQueries.mp
index d58b8c819162f449f9a13a9a9460c407e0c413dc..ab5c1fa2d3d468cc3a8da710149cb6b9d620eaa6 100644
--- a/models/Example10_PipeFilter_TraceAnnotationQueries.mp
+++ b/models/Example10_PipeFilter_TraceAnnotationQueries.mp
@@ -8,7 +8,7 @@
│*│ │ To demonstrate how to conduct a queries for model │ │
│*│ │ properties using automatic trace annotation. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This is a behavior model of a pipe/filter │ │
│*│ │ architecture with two filters. The assumptions are │ │
diff --git a/models/Example11_PublishSubscribe_AsynchronousCoordination.mp b/models/Example11_PublishSubscribe_AsynchronousCoordination.mp
index 641ed05b0fe9941857d8543845b1be02e611d7a6..28ed4be3f4d3bdedfd7c9a328555326019c5f12f 100644
--- a/models/Example11_PublishSubscribe_AsynchronousCoordination.mp
+++ b/models/Example11_PublishSubscribe_AsynchronousCoordination.mp
@@ -9,7 +9,7 @@
│*│ │ coordination to get all valid permutations of │ │
│*│ │ coordinated events. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This is a model of a Publish-Subscribe │ │
│*│ │ architecture. A Publisher sends a notification to │ │
diff --git a/models/Example12_RingTopology_UserDefinedRelations.mp b/models/Example12_RingTopology_UserDefinedRelations.mp
index 2e2a8e25be1fde12d04fdbbeefe303ce1d08615b..0010eb5f0fe941a7c01bc46a9bd1728459a4c3ee 100644
--- a/models/Example12_RingTopology_UserDefinedRelations.mp
+++ b/models/Example12_RingTopology_UserDefinedRelations.mp
@@ -7,7 +7,7 @@
│*│ ┌─[ Purpose ]────────────────────────────────────────┠│
│*│ │ To demonstrate the use of user-defined relations. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ The following is a model of network ring, where │ │
│*│ │ each node interacts with its left and right │ │
diff --git a/models/Example13_ConsumersSuppliers_DependencyTracking.mp b/models/Example13_ConsumersSuppliers_DependencyTracking.mp
index d8b118f939ac6be0632d262e920fa89a61f896c4..3d9f19e2b8f8b63e2de5c3187981e8bb7d31d295 100644
--- a/models/Example13_ConsumersSuppliers_DependencyTracking.mp
+++ b/models/Example13_ConsumersSuppliers_DependencyTracking.mp
@@ -9,7 +9,7 @@
│*│ │ and event dependency tracking for chains of │ │
│*│ │ related events. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This is a model of consumers and suppliers │ │
│*│ │ interacting in a general supply chain. A │ │
diff --git a/models/Example14_ShoppingSpree_NumberAttributes.mp b/models/Example14_ShoppingSpree_NumberAttributes.mp
index 1ffdcb495036225fb4aab5cdef93573bfae576fd..63eea979ce7e0068f385dd9394156dfab731619a 100644
--- a/models/Example14_ShoppingSpree_NumberAttributes.mp
+++ b/models/Example14_ShoppingSpree_NumberAttributes.mp
@@ -10,7 +10,7 @@
│*│ │ and an average cost of items across all events in │ │
│*│ │ a trace. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ In this model, a Buyer goes to two different shops │ │
│*│ │ that are selling items. Each item has a price. The │ │
diff --git a/models/Example15_BackpackWeight_IntervalAttributes.mp b/models/Example15_BackpackWeight_IntervalAttributes.mp
index fd9edde085bb1f4dc5b00e4062ac716c1be4112d..60f939533fe3c891e12c65f9ba31cb731698cebe 100644
--- a/models/Example15_BackpackWeight_IntervalAttributes.mp
+++ b/models/Example15_BackpackWeight_IntervalAttributes.mp
@@ -11,7 +11,7 @@
│*│ │ individual items in each trace, and to ensure a │ │
│*│ │ total weight limit is not exceeded by any trace. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ The task is to load a backpack with items not │ │
│*│ │ exceeding a total weight of 30 units. There may be │ │
diff --git a/models/Example16_StackBehavior_ProbabilityCalculationsType1.mp b/models/Example16_StackBehavior_ProbabilityCalculationsType1.mp
index d054f85ea516235f3f9c7ae0afdaf630615f90f0..a5898244f7ab8dca00138b6dfa10e6b2e7c195ca 100644
--- a/models/Example16_StackBehavior_ProbabilityCalculationsType1.mp
+++ b/models/Example16_StackBehavior_ProbabilityCalculationsType1.mp
@@ -7,7 +7,7 @@
│*│ ┌─[ Purpose ]────────────────────────────────────────┠│
│*│ │ To obtain the probability of each valid trace. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This is a behavior model of simple stack behavior. │ │
│*│ │ Valid behaviors don’t permit a scenario when the │ │
diff --git a/models/Example17_SharedEvents_ProbabilityCalculationsType1.mp b/models/Example17_SharedEvents_ProbabilityCalculationsType1.mp
index 37503da8ef58555d018bddf25d4d5cf725837ea6..3cfb81dd38279685e2446a5fee7f27286902a853 100644
--- a/models/Example17_SharedEvents_ProbabilityCalculationsType1.mp
+++ b/models/Example17_SharedEvents_ProbabilityCalculationsType1.mp
@@ -7,7 +7,7 @@
│*│ ┌─[ Purpose ]────────────────────────────────────────┠│
│*│ │ To obtain the probability of each valid trace. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This is a behavior model of two friends out to │ │
│*│ │ lunch. Menu options include a large salad, a half │ │
diff --git a/models/Example18_RedGreen_BayesianProbabilityCalculationsType2.mp b/models/Example18_RedGreen_BayesianProbabilityCalculationsType2.mp
index f80fa92add1977092031592d06f88357fe50029b..15b8d29f71c0efb9ab29d88a8a04d569ae0e27b9 100644
--- a/models/Example18_RedGreen_BayesianProbabilityCalculationsType2.mp
+++ b/models/Example18_RedGreen_BayesianProbabilityCalculationsType2.mp
@@ -10,7 +10,7 @@
│*│ │ probability of an event appearing within a given │ │
│*│ │ trace. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This behavior model demonstrates how to compute │ │
│*│ │ probabilities for events that depend on other │ │
diff --git a/models/Example19_StackBehavior_BayesianProbabilityCalculationsType2.mp b/models/Example19_StackBehavior_BayesianProbabilityCalculationsType2.mp
index af078a965f68baf78fdcbc3e30d9d9bafbe21cbe..c8c4f9118f33fa2b0c219566063ac866113a008d 100644
--- a/models/Example19_StackBehavior_BayesianProbabilityCalculationsType2.mp
+++ b/models/Example19_StackBehavior_BayesianProbabilityCalculationsType2.mp
@@ -11,7 +11,7 @@
│*│ │ how to make the probability of an event dependent │ │
│*│ │ on events happening before it. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model uses the stack behavior model to │ │
│*│ │ illustrate the main parts in probabilistic MP │ │
diff --git a/models/Example20_Activity_Diagram.mp b/models/Example20_Activity_Diagram.mp
index d7602e7464d1b32b49382f92e95215fe580edc98..86de9ff933b569f0e4d9cce74aec4cda2b183569 100644
--- a/models/Example20_Activity_Diagram.mp
+++ b/models/Example20_Activity_Diagram.mp
@@ -8,7 +8,7 @@
│*│ │ To show how to extract Activity Diagrams of root │ │
│*│ │ events in a schema. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model demonstrates how to use "SHOW ACTIVITY │ │
│*│ │ DIAGRAM" to display events as a flowcharts similar │ │
diff --git a/models/Example21_DataFlow_LocalReport.mp b/models/Example21_DataFlow_LocalReport.mp
index 9caea1a5be66aa043366b0224c59d767c69416e9..c1d40c4059e3a4e03f3fed628621a526512a9aeb 100644
--- a/models/Example21_DataFlow_LocalReport.mp
+++ b/models/Example21_DataFlow_LocalReport.mp
@@ -8,7 +8,7 @@
│*│ │ To show how to produce a local report within a │ │
│*│ │ trace. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ A report is a sequence of related SAY clauses │ │
│*│ │ assembled together to make it easier to read and │ │
diff --git a/models/Example22_UnreliableMessageFlow_GlobalReport.mp b/models/Example22_UnreliableMessageFlow_GlobalReport.mp
index e6a08ae0499162c37e096d1d983106d271964d0d..59b17dfb8d400f79430fbcdfda3b9e47bdebe212 100644
--- a/models/Example22_UnreliableMessageFlow_GlobalReport.mp
+++ b/models/Example22_UnreliableMessageFlow_GlobalReport.mp
@@ -9,7 +9,7 @@
│*│ │ To show how to produce a global report across all │ │
│*│ │ traces. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ A global report may be used to assemble │ │
│*│ │ information about all traces, e.g., total number │ │
diff --git a/models/Example23_CarRace_LocalGraph.mp b/models/Example23_CarRace_LocalGraph.mp
index 1df78257f2047b980cd1d8e4574c08f716ce6304..f38b4a8843d5064884000ec9665e8d34aff1e3f9 100644
--- a/models/Example23_CarRace_LocalGraph.mp
+++ b/models/Example23_CarRace_LocalGraph.mp
@@ -8,7 +8,7 @@
│*│ │ To demonstrate the construction of a local graph │ │
│*│ │ on a trace. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ Graphs are "entity-relation" models extracted from │ │
│*│ │ event traces in order to visualize certain │ │
diff --git a/models/Example24_ATMWithdrawal_ComponentDiagram.mp b/models/Example24_ATMWithdrawal_ComponentDiagram.mp
index 580ad092ef4d55737ce14f30eb1d1028aeb6663b..150a5c807c34af25b4dd1e8aa54485566fcdec4a 100644
--- a/models/Example24_ATMWithdrawal_ComponentDiagram.mp
+++ b/models/Example24_ATMWithdrawal_ComponentDiagram.mp
@@ -8,7 +8,7 @@
│*│ │ To demonstrate the construction of a global graph │ │
│*│ │ from all traces in the schema. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model builds upon the ATM Withdrawal behavior │ │
│*│ │ from Example 4 in the MP manual. It shows how to │ │
diff --git a/models/Example24a_Compiler_ComponentDiagram.mp b/models/Example24a_Compiler_ComponentDiagram.mp
index 034db4f22eb33016b32d16228711c32fec94e11d..9b7c6797b539f57ad712d69a278573d0436bfa8c 100644
--- a/models/Example24a_Compiler_ComponentDiagram.mp
+++ b/models/Example24a_Compiler_ComponentDiagram.mp
@@ -8,7 +8,7 @@
│*│ │ To demonstrate the construction of a global graph │ │
│*│ │ from all traces in the schema. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model builds upon the Compiler behavior from │ │
│*│ │ Example 42 in the MP manual. It shows how to │ │
diff --git a/models/Example25_Graph_as_Data_Structure.mp b/models/Example25_Graph_as_Data_Structure.mp
index 764dc196aeedd0cbc495343366d98c2c0ede40b4..3aac428d21da044b9fed79a91cca4a916169cd99 100644
--- a/models/Example25_Graph_as_Data_Structure.mp
+++ b/models/Example25_Graph_as_Data_Structure.mp
@@ -9,7 +9,7 @@
│*│ │ structure for accumulating and rendering │ │
│*│ │ statistics from event traces. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ Graphs can be used as container data structures │ │
│*│ │ (associative arrays) to store and retrieve data │ │
diff --git a/models/Example26_UnreliableMessageFlow_GlobalQuery.mp b/models/Example26_UnreliableMessageFlow_GlobalQuery.mp
index df1be321590bc7b8dae4219efbc8d56853fcbf80..49ed81a1567c8a9b6910db7c15ae0cd99d1360b7 100644
--- a/models/Example26_UnreliableMessageFlow_GlobalQuery.mp
+++ b/models/Example26_UnreliableMessageFlow_GlobalQuery.mp
@@ -8,7 +8,7 @@
│*│ ┌─[ Purpose ]────────────────────────────────────────┠│
│*│ │ To demonstrate the use of GLOBAL attributes. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This example uses the Unreliable Message Flow from │ │
│*│ │ Example 8 in the MP manual to show how to │ │
@@ -29,9 +29,9 @@
│*│ │ than 5. That can be done using explicit iteration │ │
│*│ │ limit (running for instance, for scope 1), like: │ │
│*│ │ │ │
-│*│ │ ROOT Sender: (+<1..7> send +); │ │
-│*│ │ ROOT Receiver: (+<1..7> (receive |<<0.2>> │ │
-│*│ │ does_not_receive) +); │ │
+│*│ │ ROOT Sender: (+<1..7> send +); │ │
+│*│ │ ROOT Receiver: (+<1..7> (receive |<<0.2>> │ │
+│*│ │ does_not_receive) +); │ │
│*│ └────────────────────────────────────────────────────┘ │
│*│ │
│*│ ┌─[ References ]─────────────────────────────────────┠│
diff --git a/models/Example27_Table_and_Bar_Chart.mp b/models/Example27_Table_and_Bar_Chart.mp
index 87f4d1ae950f6e373c1295290ccdab0fc9b27dcf..922b7e37bfbcc356b1c2315a09488fb5832d6115 100644
--- a/models/Example27_Table_and_Bar_Chart.mp
+++ b/models/Example27_Table_and_Bar_Chart.mp
@@ -9,7 +9,7 @@
│*│ │ current trace in a table and then render the table │ │
│*│ │ as a bar chart. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This example model shows how to create and │ │
│*│ │ populate a table with data collected from a graph │ │
diff --git a/models/Example28_Histogram.mp b/models/Example28_Histogram.mp
index 878d4ca1f9f63fe46c4e49bfebe22fde8c914277..aa966ac9e85f2e39194581cd8c36cf178cd0ca00 100644
--- a/models/Example28_Histogram.mp
+++ b/models/Example28_Histogram.mp
@@ -9,7 +9,7 @@
│*│ │ histogram from Type 1 probabilities of traces in │ │
│*│ │ an MP model. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ A histogram represents the distribution of │ │
│*│ │ numerical data into "bins" or "buckets." The first │ │
diff --git a/models/Example29_Gantt_Chart.mp b/models/Example29_Gantt_Chart.mp
index ba31d39ba050e3264b986eaf2f89f8e8433cd0c7..e0caca67c9c937bd32ac9ccaecaf1d25d7626cfb 100644
--- a/models/Example29_Gantt_Chart.mp
+++ b/models/Example29_Gantt_Chart.mp
@@ -8,7 +8,7 @@
│*│ │ To demonstrate how to construct a Gantt Chart │ │
│*│ │ using event timing attributes. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model shows how to assign non-zero timing │ │
│*│ │ attributes to events and visualize the whole-trace │ │
diff --git a/models/Example30_MicrowaveOven_ModelingModelChecking.mp b/models/Example30_MicrowaveOven_ModelingModelChecking.mp
index 59e5dd50299178fe0a165864a81d262979c21367..138220fcb522c51956a06fb32fce42c549523993 100644
--- a/models/Example30_MicrowaveOven_ModelingModelChecking.mp
+++ b/models/Example30_MicrowaveOven_ModelingModelChecking.mp
@@ -7,7 +7,7 @@
│*│ ┌─[ Purpose ]────────────────────────────────────────┠│
│*│ │ To demonstrate model checking for a small scope. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This is a behavior model of a microwave oven built │ │
│*│ │ from states and transitions [Clarke et al. 1999, │ │
diff --git a/models/Example31_Petri_Net.mp b/models/Example31_Petri_Net.mp
index 8a15fe46fbde09bee0faf194ee52661939bc3b7a..18dc70cce6e8aaf28da759c0be3dede3372effac 100644
--- a/models/Example31_Petri_Net.mp
+++ b/models/Example31_Petri_Net.mp
@@ -7,7 +7,7 @@
│*│ ┌─[ Purpose ]────────────────────────────────────────┠│
│*│ │ To demonstrate the modeling of a Petri net in MP. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This is a behavior model of the Petri net diagram │ │
│*│ │ above Example 28 in the MP v.4 Language Manual. │ │
diff --git a/models/Example32_ATMWithdrawal_StatechartView.mp b/models/Example32_ATMWithdrawal_StatechartView.mp
index 5e140ac7f102c55eeef0934d281d844c7f49d153..e25ba1f6d0df3781589c0e136f928641aca1342e 100644
--- a/models/Example32_ATMWithdrawal_StatechartView.mp
+++ b/models/Example32_ATMWithdrawal_StatechartView.mp
@@ -9,7 +9,7 @@
│*│ │ To demonstrate how to extract a Statechart view │ │
│*│ │ from an MP model. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ A statechart model is a diagram where states │ │
│*│ │ represent states of the system and transitions │ │
diff --git a/models/Example33_FiniteStateDiagram_PathAnnotation.mp b/models/Example33_FiniteStateDiagram_PathAnnotation.mp
index 73b639fb3ca4ce295f8509bc87acf7a351cfaf3c..ad6037bca40a1005199b5cf8cf23b7b7466fd042 100644
--- a/models/Example33_FiniteStateDiagram_PathAnnotation.mp
+++ b/models/Example33_FiniteStateDiagram_PathAnnotation.mp
@@ -12,7 +12,7 @@
│*│ │ 2) generate event traces as annotated paths │ │
│*│ │ through the diagram. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ The following MP schema models the behavior of a │ │
│*│ │ finite state diagram with a single state loop │ │
diff --git a/models/Example34_FiniteStateDiagram_PathDiagram.mp b/models/Example34_FiniteStateDiagram_PathDiagram.mp
index 25cb804b2c40fb501d3175db6080520edb47a850..e7c81b35d688748a485d6f694f1fcb8a9dc03c07 100644
--- a/models/Example34_FiniteStateDiagram_PathDiagram.mp
+++ b/models/Example34_FiniteStateDiagram_PathDiagram.mp
@@ -12,7 +12,7 @@
│*│ │ 2) the state transition diagram in the global │ │
│*│ │ view. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ The following MP code modifies the code in Example │ │
│*│ │ 26 from the MP Language Manual to add a path graph │ │
diff --git a/models/Example35_Authentication_SystemReuse.mp b/models/Example35_Authentication_SystemReuse.mp
index 021423dd408b7bd3e82c15ebb5a4e0a6611f3c18..116566b7fa9615952401be2aba0b90a1401a0c87 100644
--- a/models/Example35_Authentication_SystemReuse.mp
+++ b/models/Example35_Authentication_SystemReuse.mp
@@ -9,7 +9,7 @@
│*│ │ composition operation. Authentication system's │ │
│*│ │ behavior for reuse with MAP operation. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model of an authentication subsystem maps │ │
│*│ │ reusable behaviors of a generic Requester onto │ │
diff --git a/models/Example36_Compiler1_ComponentReuse.mp b/models/Example36_Compiler1_ComponentReuse.mp
index 1e4c9c6a04857b33aa63a437887a2a9e68901ea4..1297eb752483f8f9454e4d94aa15c6bbd677bb0e 100644
--- a/models/Example36_Compiler1_ComponentReuse.mp
+++ b/models/Example36_Compiler1_ComponentReuse.mp
@@ -11,7 +11,7 @@
│*│ │ the specification of component behavior and the │ │
│*│ │ specification of interactions between components. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ Examples 36 and 37 are models of a bottom-up │ │
│*│ │ parser with lexical analyzer based on regular │ │
diff --git a/models/Example37_Compiler2_ComponentReuse.mp b/models/Example37_Compiler2_ComponentReuse.mp
index 7a2827cb12d96572ebbd81424d594ce60b8ab2ef..f8c98e40c6f79d5627d72653177dee7cd4774452 100644
--- a/models/Example37_Compiler2_ComponentReuse.mp
+++ b/models/Example37_Compiler2_ComponentReuse.mp
@@ -10,7 +10,7 @@
│*│ │ the specification of component behavior and the │ │
│*│ │ specification of interactions between components. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ Examples 36 and 37 are models of a bottom-up │ │
│*│ │ parser with lexical analyzer based on regular │ │
diff --git a/models/Example38_Merging_Root_Events_to_Reduce_Run_Time.mp b/models/Example38_Merging_Root_Events_to_Reduce_Run_Time.mp
index 86f4296917331f8bc2a5637ecc3cb24abb768d2f..fdfc824ac4f401d7c4822777bd86c6c7f526d327 100644
--- a/models/Example38_Merging_Root_Events_to_Reduce_Run_Time.mp
+++ b/models/Example38_Merging_Root_Events_to_Reduce_Run_Time.mp
@@ -10,7 +10,7 @@
│*│ │ derivations in order to reduce run time for larger │ │
│*│ │ models. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model has several interacting root events, │ │
│*│ │ where roots B and C have several coordination │ │
diff --git a/models/Language_concepts/Event_Sharing_Using_COORDINATE_with_SHARE.mp b/models/Language_concepts/Event_Sharing_Using_COORDINATE_with_SHARE.mp
index f54c4109b219822eeeacb7b562a939105e392203..5518b1bfe15c72ee914c4b54c629f21634323132 100644
--- a/models/Language_concepts/Event_Sharing_Using_COORDINATE_with_SHARE.mp
+++ b/models/Language_concepts/Event_Sharing_Using_COORDINATE_with_SHARE.mp
@@ -1,15 +1,15 @@
/*┬────────────────────────────────────────────────────────â”
│*│ ┌─[ Title and Authors ]──────────────────────────────┠│
-│*│ │ Event Sharing Using COORDINATE with SHARE │ │
+│*│ │ Event Sharing Using COORDINATE with SHARE │ │
│*│ │ Created by Kristin Giammarco and Mike Collins │ │
-│*│ │ 2021-11-11 │ │
+│*│ │ 2021-11-11 │ │
│*│ └────────────────────────────────────────────────────┘ │
│*│ │
│*│ ┌─[ Purpose ]────────────────────────────────────────┠│
│*│ │ To illustrate how SHARE ALL is a shortcut for a │ │
│*│ │ COORDINATE statement with SHARE. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model shows the use of COORDINATE statements │ │
│*│ │ in lieu of SHARE ALL statements, illustrating how │ │
@@ -22,7 +22,7 @@
│*│ │ Understanding how SHARE and SHARE ALL work is │ │
│*│ │ helpful when there is a need to compose more │ │
│*│ │ complex sharing operations, such as sharing among │ │
-│*│ │ composite events. │ │
+│*│ │ composite events. │ │
│*│ └────────────────────────────────────────────────────┘ │
│*│ │
│*│ ┌─[ References ]─────────────────────────────────────┠│
@@ -31,9 +31,9 @@
│*│ │ Workflow Modeling Language Manual" (Version 4). │ │
│*│ │ 2020. Available online: │ │
│*│ │ https://wiki.nps.edu/display/MP/Documentation │ │
-│*│ │ │ │
+│*│ │ │ │
│*│ │ Example02_DataFlow_EventSharing. Available online:│ │
-│*│ │ https://nps.edu/mp/models > Language_concepts │ │
+│*│ │ https://nps.edu/mp/models > Language_concepts │ │
│*│ └────────────────────────────────────────────────────┘ │
│*│ │
│*│ ┌─[ Search Terms ]───────────────────────────────────┠│
diff --git a/models/Language_concepts/Event_Sharing_in_Composite_Events.mp b/models/Language_concepts/Event_Sharing_in_Composite_Events.mp
index c8ba31c32eb8f010dd1b3d6febf1cdef1627c423..3d6408fb17f12e2158074f3ecc9569f335109ae4 100644
--- a/models/Language_concepts/Event_Sharing_in_Composite_Events.mp
+++ b/models/Language_concepts/Event_Sharing_in_Composite_Events.mp
@@ -1,20 +1,20 @@
/*┬────────────────────────────────────────────────────────â”
│*│ ┌─[ Title and Authors ]──────────────────────────────┠│
-│*│ │ Event Sharing in Composite Events │ │
+│*│ │ Event Sharing in Composite Events │ │
│*│ │ Created by Kristin Giammarco and Mike Collins │ │
-│*│ │ 2021-11-11 │ │
+│*│ │ 2021-11-11 │ │
│*│ └────────────────────────────────────────────────────┘ │
│*│ │
│*│ ┌─[ Purpose ]────────────────────────────────────────┠│
│*│ │ To illustrate how to share events within composite │ │
-│*│ │ events. │ │
+│*│ │ events. │ │
│*│ └────────────────────────────────────────────────────┘ │
-│*│ │
+│*│ │
│*│ ┌─[ Description ]────────────────────────────────────┠│
│*│ │ This model shows the use of COORDINATE statements │ │
-│*│ │ to perform event sharing inside of composite │ │
-│*│ │ events. This operation uses nested COORDINATE │ │
-│*│ │ statements to navigate the event hierarchy. │ │
+│*│ │ to perform event sharing inside of composite │ │
+│*│ │ events. This operation uses nested COORDINATE │ │
+│*│ │ statements to navigate the event hierarchy. │ │
│*│ └────────────────────────────────────────────────────┘ │
│*│ │
│*│ ┌─[ References ]─────────────────────────────────────┠│
@@ -23,9 +23,9 @@
│*│ │ Workflow Modeling Language Manual" (Version 4). │ │
│*│ │ 2020. Available online: │ │
│*│ │ https://wiki.nps.edu/display/MP/Documentation │ │
-│*│ │ │ │
+│*│ │ │ │
│*│ │ Example02_DataFlow_EventSharing. Available online:│ │
-│*│ │ https://nps.edu/mp/models > Language_concepts │ │
+│*│ │ https://nps.edu/mp/models > Language_concepts │ │
│*│ └────────────────────────────────────────────────────┘ │
│*│ │
│*│ ┌─[ Search Terms ]───────────────────────────────────┠│