25:
229:. Marked graphs are used mostly to mathematically represent concurrently running operations, such as a multiprocessor machine's internal process state. This class of Petri nets gets the name from a popular way of representing them: as a graph where each place is an edge and each transition is a node.
261:
at T4. In between, two operations take place in non-deterministic fashion, T2 and T3. In fact, Petri nets are so much non-deterministic, that they may not take place at all. But the reason for having this non-deterministic property is not this, but to mimic real-life experiences which shows that
246:
227:
237:
Marked graphs are mainly used to mathematically represent concurrent mechanisms, in order to be able to mathematically derive certain characteristics of the design.
266:
always means that it is impossible to determine which process/thread will finish first i.e. which operation(s) will execute faster. This can be due to waiting for
116:
159:
50:
97:
46:
69:
76:
245:
35:
83:
254:
144:
in which every place has exactly one incoming arc, and exactly one outgoing arc. This means, that there can
54:
39:
65:
258:
282:
263:
90:
276:
267:
130:
270:
in real world, or just the different parameters given to the processes/threads.
24:
141:
129:
This article is about Petri nets. For vertex-signed graphs, see
18:
244:
253:
This example presents a Marked Graph, where a process is
222:{\displaystyle \forall p\in P:|p\bullet |=|\bullet p|=1}
162:
221:
8:
53:. Unsourced material may be challenged and
208:
197:
189:
178:
161:
117:Learn how and when to remove this message
7:
51:adding citations to reliable sources
163:
14:
23:
209:
198:
190:
179:
1:
299:
128:
16:Specific type of Petri net
250:
223:
257:at transition T1 and
248:
224:
249:Marked Graph example
160:
47:improve this article
152:, but there can be
264:parallel computing
251:
219:
156:. Mathematically:
127:
126:
119:
101:
290:
228:
226:
225:
220:
212:
201:
193:
182:
122:
115:
111:
108:
102:
100:
59:
27:
19:
298:
297:
293:
292:
291:
289:
288:
287:
273:
272:
243:
235:
158:
157:
134:
123:
112:
106:
103:
60:
58:
44:
28:
17:
12:
11:
5:
296:
294:
286:
285:
275:
274:
242:
239:
234:
231:
218:
215:
211:
207:
204:
200:
196:
192:
188:
185:
181:
177:
174:
171:
168:
165:
125:
124:
66:"Marked graph"
31:
29:
22:
15:
13:
10:
9:
6:
4:
3:
2:
295:
284:
281:
280:
278:
271:
269:
265:
260:
256:
247:
240:
238:
232:
230:
216:
213:
205:
202:
194:
186:
183:
175:
172:
169:
166:
155:
151:
147:
143:
139:
132:
121:
118:
110:
107:December 2009
99:
96:
92:
89:
85:
82:
78:
75:
71:
68: –
67:
63:
62:Find sources:
56:
52:
48:
42:
41:
37:
32:This article
30:
26:
21:
20:
259:synchronised
252:
236:
153:
149:
145:
138:marked graph
137:
135:
131:signed graph
113:
104:
94:
87:
80:
73:
61:
45:Please help
33:
154:concurrency
283:Petri nets
77:newspapers
203:∙
187:∙
170:∈
164:∀
142:Petri net
34:does not
277:Category
150:conflict
241:Example
91:scholar
55:removed
40:sources
255:forked
93:
86:
79:
72:
64:
140:is a
98:JSTOR
84:books
233:Uses
70:news
38:any
36:cite
268:I/O
148:be
146:not
49:by
279::
136:A
217:1
214:=
210:|
206:p
199:|
195:=
191:|
184:p
180:|
176::
173:P
167:p
133:.
120:)
114:(
109:)
105:(
95:·
88:·
81:·
74:·
57:.
43:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
