Hallo, ich habe die folgenden beiden Petri-Netze gegeben:
Die Aufgabe ist es nun für beide Petri-Netze "Reachable-Graphs" zu erstellen.
Zu den Reachable-Graphs habe ich die folgende Vorgehensweise:
(1) Petri net reachability graph:
1. Start with the initial marking (M_0 = [1, 0, 0, 0]), representing one token in (S0) and no tokens elsewhere.
2. From (M_0), transition (T1) can fire, resulting in marking (M_1 = [0, 1, 0, 0]) (token moves to (S1)).
3. From (M_1), two transitions can fire: (T2) and (T3). Firing (T2) leads to (M_2 = [0, 0, 1, 0]) (token in (S2)), and firing (T3) leads to (M_3 = [0, 0, 0, 1]) (token in (S3)).
4. From (M_2), no further transitions can fire, which is a dead state.
5. From (M_3), transition (T4) can fire, leading back to (M_1).
(2) Petri net Reachability Graph:
1. Start with the initial marking (M_0 = [1, 0, 0, 0]).
2. Transition (T1) can fire, leading to (M_1 = [0, 1, 0, 0]).
3. From (M_1), transition ( T2 ) can fire, leading to (M_2 = [0, 0, 1, 1]) (token moves to (S3) and a new token appears in (S4) due to the nature of (T2)).
4. From (M_2), transition (T3) can fire, consuming the token in (S3) and moving it to (S2), resulting in (M_3 = [0, 0, 0, 2]) (two tokens in (S4)).
5. From (M_3), no further transitions can fire, which is another dead state.
These reachability graphs can be drawn as follows:
Nodes represent markings.
Directed edges represent transitions between markings.
Each edge is labeled with the transition that causes the change in marking.
Stehe leider dennoch auf dem Schlauch, wie die Graphen final aussehen sollen.
Kann mir bitte jemand zum ersten Petri-Netz anhand der Beschreibung ein Bild liefern, sodass ich es für das zweite selber machen kann?
Vielen Danks schonmal.
Die Aufgabe ist es nun für beide Petri-Netze "Reachable-Graphs" zu erstellen.
Zu den Reachable-Graphs habe ich die folgende Vorgehensweise:
(1) Petri net reachability graph:
1. Start with the initial marking (M_0 = [1, 0, 0, 0]), representing one token in (S0) and no tokens elsewhere.
2. From (M_0), transition (T1) can fire, resulting in marking (M_1 = [0, 1, 0, 0]) (token moves to (S1)).
3. From (M_1), two transitions can fire: (T2) and (T3). Firing (T2) leads to (M_2 = [0, 0, 1, 0]) (token in (S2)), and firing (T3) leads to (M_3 = [0, 0, 0, 1]) (token in (S3)).
4. From (M_2), no further transitions can fire, which is a dead state.
5. From (M_3), transition (T4) can fire, leading back to (M_1).
(2) Petri net Reachability Graph:
1. Start with the initial marking (M_0 = [1, 0, 0, 0]).
2. Transition (T1) can fire, leading to (M_1 = [0, 1, 0, 0]).
3. From (M_1), transition ( T2 ) can fire, leading to (M_2 = [0, 0, 1, 1]) (token moves to (S3) and a new token appears in (S4) due to the nature of (T2)).
4. From (M_2), transition (T3) can fire, consuming the token in (S3) and moving it to (S2), resulting in (M_3 = [0, 0, 0, 2]) (two tokens in (S4)).
5. From (M_3), no further transitions can fire, which is another dead state.
These reachability graphs can be drawn as follows:
Nodes represent markings.
Directed edges represent transitions between markings.
Each edge is labeled with the transition that causes the change in marking.
Stehe leider dennoch auf dem Schlauch, wie die Graphen final aussehen sollen.
Kann mir bitte jemand zum ersten Petri-Netz anhand der Beschreibung ein Bild liefern, sodass ich es für das zweite selber machen kann?
Vielen Danks schonmal.
