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