|
From: <xr...@us...> - 2010-05-17 16:24:16
|
Revision: 791
http://scstudio.svn.sourceforge.net/scstudio/?rev=791&view=rev
Author: xrehak
Date: 2010-05-17 16:24:07 +0000 (Mon, 17 May 2010)
Log Message:
-----------
Typos.
Modified Paths:
--------------
trunk/doc/help/acyclic/acyclic.html
trunk/doc/help/boundedness/boundedness.html
trunk/doc/help/livelock/livelock.html
trunk/doc/help/localchoice/localchoice.html
trunk/doc/help/race/race.html
trunk/doc/help/realizability/realizability.html
Modified: trunk/doc/help/acyclic/acyclic.html
===================================================================
--- trunk/doc/help/acyclic/acyclic.html 2010-05-17 10:25:19 UTC (rev 790)
+++ trunk/doc/help/acyclic/acyclic.html 2010-05-17 16:24:07 UTC (rev 791)
@@ -8,10 +8,10 @@
</HEAD>
<BODY>
<H1>Acyclic property</H1>
-<P> Acyclic property ensures that there is no cyclic dependency among events in a MSC. Such an dependency is erroneous, because it requires to wait with sending a message until it is received. An example of such MSC design can be seen on the following figure:</P>
+<P> Acyclic property ensures that there is no cyclic dependency among events in an MSC. Such a dependency is erroneous, because it requires to wait with sending a message until it is received. An example of such MSC design can be seen in the following figure:</P>
<IMG SRC="pictures/cyclic_simple.png" BORDER="0" ALT="Cyclic MSC" TITLE="Cyclic MSC">
<P> Sending message <I>m2</I> may not be done until message <I>m1</I> is received, but message <I>m1</I> may not be send until message <I>m2</I> is received.</P>
-<P> Result of SCStudio on such design highlights the cyclic dependency:</P>
+<P> SCStudio highlights the cyclic dependency:</P>
<IMG SRC="pictures/cyclic_result.png" BORDER="0" ALT="SCStudio result" TITLE="SCStudio result">
<P> A more tricky example of an acyclic design:</P>
<IMG SRC="pictures/acyclic.png" BORDER="0" ALT="Acyclic MSC" TITLE="Acyclic MSC">
Modified: trunk/doc/help/boundedness/boundedness.html
===================================================================
--- trunk/doc/help/boundedness/boundedness.html 2010-05-17 10:25:19 UTC (rev 790)
+++ trunk/doc/help/boundedness/boundedness.html 2010-05-17 16:24:07 UTC (rev 791)
@@ -8,7 +8,7 @@
</HEAD>
<BODY>
<H1>Universal Boundedness</H1>
-<P>is a property of an HMSC. An HMSC is universally bounded if there exists an upper limit on size of communication buffers of all involved processes. Informally, each instance waits for a response before sending the same message again. A dialogue is an example of bounded communication. E-mail spam is an example of unbounded comuunication - actually, it is not rare that an input buffer (mailbox) gets full in this case. </P>
+<P>is a property of an HMSC. An HMSC is universally bounded if there exists an upper limit on size of communication buffers of all involved processes. Informally, each instance waits for a response before sending the same message again. A dialogue is an example of bounded communication. E-mail spam is an example of unbounded communication - actually, it is not rare that an input buffer (mailbox) gets full in this case. </P>
<P>When all the possible executions of an HMSC are finite, the HMSC is universally bounded. Therefore only HMSCs containing a cycle may be unbounded. Every cycle whose repetitive execution may lead to unbounded grow of an input buffer is found and displayed by SCStudio.</P>
</BODY>
Modified: trunk/doc/help/livelock/livelock.html
===================================================================
--- trunk/doc/help/livelock/livelock.html 2010-05-17 10:25:19 UTC (rev 790)
+++ trunk/doc/help/livelock/livelock.html 2010-05-17 16:24:07 UTC (rev 791)
@@ -10,5 +10,5 @@
<H1>Livelock</H1>
<P>is a property of an HMSC. An HMSC contains a livelock if there exists a cycle of nodes from which no endnode is reachable. It is required that the cycle contains at least one reference node.</P>
-<P>SCStudio finds and displays all such cycles is a given HMSC.</P>
+<P>SCStudio finds and displays all such cycles in a given HMSC.</P>
</BODY>
Modified: trunk/doc/help/localchoice/localchoice.html
===================================================================
--- trunk/doc/help/localchoice/localchoice.html 2010-05-17 10:25:19 UTC (rev 790)
+++ trunk/doc/help/localchoice/localchoice.html 2010-05-17 16:24:07 UTC (rev 791)
@@ -28,7 +28,7 @@
<P>More formally, a branching node is called a non-local choice if one of the conditions is satisfied:</P>
<UL>
<LI> There exists a branch that is initiated by more than one instance.</LI>
-<LI> There exist two branches, such that each is initiated by different instance</LI>
+<LI> There exist two branches, such that each is initiated by different instance</LI>.
</UL>
<P>The result of the check on the previous example marks the non-local choice node by red:</P>
Modified: trunk/doc/help/race/race.html
===================================================================
--- trunk/doc/help/race/race.html 2010-05-17 10:25:19 UTC (rev 790)
+++ trunk/doc/help/race/race.html 2010-05-17 16:24:07 UTC (rev 791)
@@ -8,6 +8,6 @@
</HEAD>
<BODY>
<H1>Race Condition</H1>
-<P>occurs in an MSC if a pair of events is drawn in a particular order but the events may occur in the other order during an execution of the MSC. If the real implementation is based on the drawing, it may lead to a system failure. Please don't mix up race condition with FIFO; race condition is only applicable for MSCs that satisfy FIFO.</P>
-<P>SCStudio currently finds all such pairs of events is a given BMSC and also in BMSCs referenced by a HMSC. The race condition may also occur between events from different BMSC. SCStudio is capable of finding one such occurence.</P>
+<P>Race Condition occurs in an MSC if a pair of events is drawn in a particular order but the events may occur in the other order during an execution of the MSC. If the real implementation is based on the drawing, it may lead to a system failure. Please don't mix up race condition with FIFO; race condition is only applicable for MSCs that satisfy FIFO.</P>
+<P>SCStudio currently finds all such pairs of events in a given BMSC and also in BMSCs referenced by a HMSC. The race condition may also occur between events from different BMSC. SCStudio is capable of finding one such occurence.</P>
</BODY>
Modified: trunk/doc/help/realizability/realizability.html
===================================================================
--- trunk/doc/help/realizability/realizability.html 2010-05-17 10:25:19 UTC (rev 790)
+++ trunk/doc/help/realizability/realizability.html 2010-05-17 16:24:07 UTC (rev 791)
@@ -8,6 +8,6 @@
</HEAD>
<BODY>
<H1>Strong realizability</H1>
-<P>is a property of an HMSC. An HMSC is strongly realizable iff it is univerally bounded and local-choice.</P>
+<P>is a property of an HMSC. An HMSC is strongly realizable iff it is universally bounded and local-choice.</P>
</BODY>
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|