- Modifying the Lowest Common Ancestor (LCA) algorithm. The algorithm is an implementation of the Bender and Farach's LCA algorithm.

git-svn-id: http://svn.us.apache.org/repos/asf/tuscany@802952 13f79535-47bb-0310-9956-ffa450edef68

1 files changed, 6 insertions, 0 deletions

diff --git a/sandbox/dougsleite/guardian-model/src/test/java/org/apache/tuscany/sca/guardian/itests/concurrentexceptions/Launch.java b/sandbox/dougsleite/guardian-model/src/test/java/org/apache/tuscany/sca/guardian/itests/concurrentexceptions/Launch.java
index ff9a0e0b4b..9ac2e9113b 100644
--- a/sandbox/dougsleite/guardian-model/src/test/java/org/apache/tuscany/sca/guardian/itests/concurrentexceptions/Launch.java
+++ b/sandbox/dougsleite/guardian-model/src/test/java/org/apache/tuscany/sca/guardian/itests/concurrentexceptions/Launch.java
@@ -46,6 +46,12 @@ public class Launch {
 
         System.in.read();
 
+        System.out.println("Starting participant4...");
+        Node c4 = scaDomain.getService(Node.class, "Participant4");
+        c4.execute();
+
+        System.in.read();
+
         System.out.println("Forcing exception ocurrence at participant1...");
         TestInterface t = scaDomain.getService(TestInterface.class, "Participant1");
         t.forcePrimaryServiceFailureException();