285:
326:
64:
60:
235:
319:
345:
350:
312:
264:
241:
56:
40:
231:
178:
142:
106:
223:
190:
158:
122:
79:
63:(assuming that the process is stationary). The theorem shows that product form solutions in
212:
296:
32:
127:
110:
339:
208:
245:
68:
292:
163:
146:
284:
194:
52:
31:"Rcat" redirects here. For the usage of redirect categories on Knowledge, see
72:
227:
270:(Technical report DTR07-2). Imperial College Department of Computing.
181:(2004). "Reversed processes, product forms and a non-product form".
17:
220:
20th Annual IEEE Symposium on Logic in
Computer Science (LICS' 05)
82:, from which the stationary distribution can be computed.
300:
151:Electronic Notes in Theoretical Computer Science
111:"Turning back time in Markovian process algebra"
78:The theorem identifies a reversed process using
75:are based on the same fundamental mechanisms.
320:
8:
213:"Process Algebras for Quantitative Analysis"
327:
313:
162:
126:
263:Bradley, Jeremy T. (28 February 2008).
91:
101:
99:
97:
95:
147:"Process Algebraic Non-product-forms"
59:expressed in any formalism to have a
7:
281:
279:
61:product form stationary distribution
183:Linear Algebra and Its Applications
25:
283:
265:RCAT: From PEPA to product form
45:reversed compound agent theorem
1:
272:A short introduction to RCAT.
128:10.1016/S0304-3975(02)00375-4
299:. You can help Knowledge by
115:Theoretical Computer Science
27:Aspect of probability theory
164:10.1016/j.entcs.2006.03.012
367:
278:
29:
195:10.1016/j.laa.2004.02.020
295:-related article is a
346:Probability theorems
228:10.1109/LICS.2005.35
222:. pp. 239–248.
57:stochastic process
41:probability theory
351:Probability stubs
308:
307:
65:Jackson's theorem
55:conditions for a
16:(Redirected from
358:
329:
322:
315:
287:
280:
271:
269:
250:
249:
217:
205:
199:
198:
175:
169:
168:
166:
139:
133:
132:
130:
121:(3): 1947–2013.
103:
36:
21:
366:
365:
361:
360:
359:
357:
356:
355:
336:
335:
334:
333:
276:
267:
262:
259:
257:Further reading
254:
253:
238:
215:
207:
206:
202:
179:Harrison, P. G.
177:
176:
172:
143:Harrison, P. G.
141:
140:
136:
107:Harrison, P. G.
105:
104:
93:
88:
37:
30:
28:
23:
22:
15:
12:
11:
5:
364:
362:
354:
353:
348:
338:
337:
332:
331:
324:
317:
309:
306:
305:
288:
274:
273:
258:
255:
252:
251:
236:
200:
170:
134:
90:
89:
87:
84:
51:) is a set of
26:
24:
14:
13:
10:
9:
6:
4:
3:
2:
363:
352:
349:
347:
344:
343:
341:
330:
325:
323:
318:
316:
311:
310:
304:
302:
298:
294:
289:
286:
282:
277:
266:
261:
260:
256:
247:
243:
239:
237:0-7695-2266-1
233:
229:
225:
221:
214:
210:
204:
201:
196:
192:
188:
184:
180:
174:
171:
165:
160:
156:
152:
148:
144:
138:
135:
129:
124:
120:
116:
112:
108:
102:
100:
98:
96:
92:
85:
83:
81:
80:Kelly's lemma
76:
74:
70:
66:
62:
58:
54:
50:
46:
42:
34:
19:
301:expanding it
290:
275:
219:
209:Hillston, J.
203:
186:
182:
173:
157:(3): 61–76.
154:
150:
137:
118:
114:
77:
69:BCMP theorem
48:
44:
38:
293:probability
189:: 359–381.
340:Categories
73:G-networks
53:sufficient
211:(2005).
145:(2006).
109:(2003).
246:1236394
33:WP:RCAT
244:
234:
67:, the
43:, the
291:This
268:(PDF)
242:S2CID
216:(PDF)
86:Notes
297:stub
232:ISBN
71:and
49:RCAT
18:RCAT
224:doi
191:doi
187:386
159:doi
155:151
123:doi
119:290
39:In
342::
240:.
230:.
218:.
185:.
153:.
149:.
117:.
113:.
94:^
328:e
321:t
314:v
303:.
248:.
226::
197:.
193::
167:.
161::
131:.
125::
47:(
35:.
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.