Exercise11 various updates to all subtitle files (#22)

* Update Exercise11-Task1-de.sbv

* Update Exercise11-Task1-en.sbv

* Update Exercise11-Task2-de.sbv

* Update Exercise11-Task2-en.sbv

Uebungen/Blatt11/Exercise11-Task1-de.sbv

@@ -92,10 +92,10 @@ D, E, F und G zu kommen. Dafür führen
 
 0:05:04.380,0:05:10.140
 wir erstmal drei neue Stellen ein, die die
-unterschiedlichen Pfade darstellen sollen,
+unterschiedlichen Pfade darstellen sollen.
 
 0:05:27.120,0:05:40.800
-ein. (15 Sek.) Von der vorherigen Transition
+Von der vorherigen Transition
 geht jeweils ein Pfeil in jeden Pfad,
 
 0:05:41.880,0:05:47.880
@@ -173,8 +173,8 @@ werden, wenn wir eine entsprechende Transition
 einfügen. Danach brauchen wir wieder eine Stelle.
 
 0:09:44.400,0:09:50.040
-Den Rück-Pfad erreichen wir nur, indem wir wieder
-auf die Stelle kommen, um G erneut auszuführen.
+Den Rück-Pfad hier können wir nur repräsentieren, indem wir
+wieder auf die Stelle kommen, um G erneut auszuführen.
 
 0:09:50.040,0:09:59.100
 Dafür brauchen wir eine Hilfstransition die wir
@@ -270,4 +270,4 @@ zusammenzuführen und letztendlich das Programm
 
 0:13:39.600,0:13:47.100
 zu beenden. Wie gesagt sind diese beiden Stellen
-optional. Und damit wird die Aufgabe gelöst.
+optional. Und damit ist die Aufgabe gelöst.

Uebungen/Blatt11/Exercise11-Task1-en.sbv

@@ -1,7 +1,4 @@
-0:00:01.000,0:00:04.920
-Exercise sheet 12, task three.
-
-0:00:04.920,0:00:08.880
+0:00:00.000,0:00:08.880
 Translating an activity diagram to a Petri
 net.
 
@@ -23,11 +20,11 @@ But if it leads to something, then it has
 to be a place.
 
 0:00:32.520,0:00:36.120
-So, we add the place.
+So, we add a place.
 
 0:00:36.120,0:00:45.760
-And we can see now that this place represents
-this object node B. (Again?), we have an action,
+And we can say now that this place represents
+this object node B. Again, we have an action,
 
 0:00:45.760,0:00:52.500
 the action becomes transition C with the same
@@ -83,8 +80,8 @@ So, let's add this transition that represents
 F. And, as I said before, since this is a
 
 0:01:55.469,0:02:02.119
-Petri net, so this transition, if it's going
-to lead to something, then it has to be a
+Petri net, this transition, if it's going
+to lead to something, it has to lead to a
 
 0:02:02.119,0:02:03.119
 place.
@@ -163,11 +160,8 @@ Now let's do the right branch.
 So, this place can correspond to this merge
 node.
 
-0:03:41.970,0:03:44.500
-Now let's make.
-
-0:03:44.500,0:03:52.580
-I want to go from this place back to this
+0:03:41.970,0:03:52.580
+Now, I want to go from this place back to this
 place somehow to represent this arrow here.
 
 0:03:52.580,0:03:53.780

Uebungen/Blatt11/Exercise11-Task2-de.sbv

@@ -65,12 +65,9 @@ hier.
 Diesen können wir über ausgehende Kanten
 verlassen.
 
-0:02:29.190,0:02:37.400
+0:02:29.190,0:02:39.180
 Das sehen wir hier über diese zusammengeführten
-Zustände, also über die ausgehende Kante
-
-0:02:37.400,0:02:39.180
-d.
+Zustände, also über die ausgehende Kante d.
 
 0:02:39.180,0:02:50.989
 Das bedeutet, dass wir den Zustand verlassen
@@ -137,11 +134,11 @@ D zuletzt von 8 aus verlassen wurde?“.
 
 0:05:06.940,0:05:23.789
 Wir verlassen C von 7 und 4 aus, das heißt
-über D. Weil das die einzigen ausgehenden
+über d. Weil das die einzigen ausgehenden
 
 0:05:23.789,0:05:36.259
 Kanten von 4 und 7 sind, daher geht das nur
-über D, und D zuletzt von 8 aus verlassen
+über d, und D zuletzt von 8 aus verlassen
 
 0:05:36.259,0:05:41.039
 wurde, also von diesem hier.
@@ -235,10 +232,10 @@ Verhalten?
 
 0:08:40.349,0:08:53.829
 Die Antwort ist ja, denn wenn wir eine tiefe
-Historie haben, wird nicht nur, welcher Zustand
+Historie haben, wird nicht nur gespeichert,
 
 0:08:53.829,0:08:58.510
-auf diesem Level erfolgt ist, gespeichert,
+welcher Zustand auf diesem Level erfolgt ist,
 sondern auch tiefer.
 
 0:08:58.510,0:09:03.589
@@ -274,8 +271,8 @@ die Ausgangsmöglichkeiten aus D betrachten.
 Da kommen f und i in Frage.
 
 0:10:08.720,0:10:20.220
-Betrachten wir zunächst f: f
-erreichen wir, wenn wir direkt auf 3 springen.
+Betrachten wir zunächst f:
+f erreichen wir, wenn wir direkt auf 3 springen.
 
 0:10:20.220,0:10:35.220
 Weil das in einer swim-lane ist und ein Startknoten
@@ -316,7 +313,7 @@ Wenn wir zuvor in C waren und zum Beispiel
 dass wir zuvor in Zustand 6 waren.
 
 0:11:57.710,0:12:14.880
-Wenn B über E oder D verlassen haben, würde
+Wenn wir B über e oder d verlassen haben, würde
 C in der flachen Historie gespeichert worden
 
 0:12:14.880,0:12:16.670

Uebungen/Blatt11/Exercise11-Task2-en.sbv

@@ -1,6 +1,3 @@
-0:00:00.530,0:00:06.720
-Exercise sheet 12, task four.
-
 0:00:06.720,0:00:11.680
 Before I start answering the questions, I
 would like to point out some important things.
@@ -25,7 +22,7 @@ into nine.
 
 0:00:41.380,0:00:52.640
 So, in comparison, this transition is doing
-us an explicit entry.
+an explicit entry.
 
 0:00:52.640,0:01:00.140
 While this transition, for example, E is not
@@ -36,7 +33,7 @@ entry, because it's going to the D as a whole.
 
 0:01:04.960,0:01:13.760
 And then the decision becomes that we start
-with a starting state, which is ten.
+with the starting state, which is ten.
 
 0:01:13.760,0:01:20.799
 The general structure of this diagram is that
@@ -75,7 +72,7 @@ the diagram start?
 The answer is six and three.
 
 0:02:19.580,0:02:24.550
-Since the fork explicitly jumps to the States
+Since the fork explicitly jumps to the states
 at the beginning, this is the fork we are
 
 0:02:24.550,0:02:26.200
@@ -100,7 +97,7 @@ C it's going to this state three.
 
 0:02:59.740,0:03:05.860
 And here it's doing the same and it's going
-to into state six.
+into state six.
 
 0:03:05.860,0:03:15.330
 Question B. Name all possible states or combinations
@@ -125,10 +122,10 @@ which is a joint state.
 
 0:03:47.900,0:03:54.530
 The second possibility is to exit with the
-help of this transition E. And when you exit
+help of this transition, e. And when you exit
 
 0:03:54.530,0:04:01.340
-with E, it doesn't matter where you are, it
+with e, it doesn't matter where you are, it
 doesn't matter where which state you are currently
 
 0:04:01.340,0:04:02.659
@@ -164,8 +161,8 @@ This happens because here it says we leave
 C from seven and four.
 
 0:04:43.979,0:04:53.380
-This means we do this transition D, and this
-transition D is not pointing at any interstate
+This means we do this transition d, and this
+transition d is not pointing at any inner state
 
 0:04:53.380,0:04:59.250
 of D. It's just pointing at D as a whole.
@@ -210,7 +207,7 @@ So, it remembers we were at E or at C. And
 that's it.
 
 0:06:08.530,0:06:12.479
-It doesn't look at the interstates one or
+It doesn't look at the inner states one or
 two.
 
 0:06:12.479,0:06:17.389
@@ -235,7 +232,7 @@ state points at one.
 This means we start with one.
 
 0:06:50.690,0:06:57.830
-Next question says, does the answer to D change
+Next question says, does the answer to (d) change
 if we change that shallow history state to
 
 0:06:57.830,0:06:59.930
@@ -248,8 +245,8 @@ And if so, how?
 The answer is yes.
 
 0:07:05.530,0:07:13.129
-Because as I discussed before, the deepest
-two would remember exactly which one of those
+Because as I discussed before, the deep
+history would remember exactly which one of those
 
 0:07:13.129,0:07:18.099
 one or two we were at.
@@ -346,7 +343,7 @@ starting states.
 
 0:09:42.620,0:09:56.140
 Now the second possibility is to go from eight
-with the transition I if B, this B was last
+with the transition i if B, this B, was last
 
 0:09:56.140,0:10:02.540
 exited from C which is this state here.
@@ -360,11 +357,11 @@ shallow history remembers one thing, which
 
 0:10:15.190,0:10:21.180
 is that we were in C. As I said before, it
-doesn't care which in our state we were at.
+doesn't care which inner state we were at.
 
 0:10:21.180,0:10:33.140
 So, this means when we go from eight with
-I into B, we go into C and with C, we just
+i into B, we go into C and with C, we just
 
 0:10:33.140,0:10:36.910
 start with these two starting states.