1180:
32:
493:
356:
697:
541:
565:
643:
1001:
488:{\displaystyle P::=(a,\lambda ).P\,\,\,|\,\,\,P+Q\,\,\,|\,\,\,P{\stackrel {\triangleright \!\!\triangleleft }{\scriptstyle {L}}}Q\,\,\,|\,\,\,P/L\,\,\,|\,\,\,A}
1089:
1051:
283:
The co-operation operator requires the two "co-operands" to join for those activities which are specified in the co-operation set: in the process
1210:
947:
320:
1084:
1074:
994:
159:
865:
11th IEEE/ACM International
Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003
1079:
888:
760:
658:
151:
115:
930:
Stefanek, A.; Hayden, R. A.; Bradley, J. T. (2011). "GPA - A Tool for Fluid
Scalability Analysis of Massively Parallel Systems".
177:(CTMC). Thus the language can be used to study quantitative properties of models of computer and communication systems such as
316:
1024:
174:
53:
1150:
1184:
987:
1160:
1145:
1140:
186:
182:
96:
42:
1135:
1034:
68:
1205:
166:
1165:
75:
1039:
190:
49:
82:
1010:
797:
508:
1029:
953:
894:
820:
718:
170:
64:
200:
As with most process algebras, PEPA is a parsimonious language. It has only four combinators,
943:
884:
756:
550:
611:, the action must be carried out jointly and a race condition determines the time this takes.
1099:
1066:
935:
876:
868:
812:
858:"Derivation of passage-time densities in PEPA models using ipc: the imperial PEPA compiler"
628:
1056:
1046:
139:
1155:
782:
749:
603:
exist simultaneously and behave independently for actions whose names do not appear in
194:
857:
1199:
1114:
1094:
744:
143:
957:
1104:
824:
346:
Given a set of action names, the set of PEPA processes is defined by the following
240:. Choice sets up a competition between two possible alternatives: in the process (
155:
147:
89:
898:
1130:
872:
347:
31:
20:
216:. Prefix is the basic building block of a sequential component: the process (
178:
136:
816:
932:
2011 Eighth
International Conference on Quantitative Evaluation of SysTems
880:
856:
Bradley, J. T.; Dingle, N. J.; Gilmore, S. T.; Knottenbelt, W. J. (2003).
939:
913:"Google Code Archive - Long-term storage for Google Code Project Hosting"
912:
142:
designed for modelling computer and communication systems introduced by
979:
146:
in the 1990s. The language extends classical process algebras such as
319:
gives a set of sufficient conditions for a co-operation to have a
162:
by introducing probabilistic branching and timing of transitions.
983:
974:
838:
338:
from view (and prevents other processes from joining with it).
315:, but any other activities may be performed independently. The
692:{\displaystyle A{\overset {\underset {\mathrm {def} }{}}{=}}P}
25:
726:
GPAnalyser for fluid analysis of massively parallel systems
276:
wins the race (and the process subsequently behaves as
268:
wins the race (and the process subsequently behaves as
189:. The language is formally defined using a structured
185:
as well as qualitative properties such as freedom from
169:
and PEPA models are finite-state and so give rise to a
498:
The parts of the syntax are, in the order given above
425:
661:
631:
553:
511:
359:
1123:
1065:
1017:
56:. Unsourced material may be challenged and removed.
748:
691:
637:
559:
535:
487:
751:A Compositional Approach to Performance Modelling
438:
437:
796:Tribastone, M.; Duguid, A.; Gilmore, S. (2009).
995:
8:
975:PEPA: Performance Evaluation Process Algebra
805:ACM SIGMETRICS Performance Evaluation Review
1002:
988:
980:
672:
665:
660:
630:
621:behaves as usual for action names not in
552:
510:
481:
480:
479:
474:
473:
472:
471:
463:
459:
458:
457:
452:
451:
450:
449:
433:
426:
424:
422:
421:
417:
416:
415:
410:
409:
408:
407:
397:
396:
395:
390:
389:
388:
387:
358:
116:Learn how and when to remove this message
736:
236:before evolving to behave as component
129:Performance Evaluation Process Algebra
7:
607:. For actions whose names appear in
321:product form stationary distribution
54:adding citations to reliable sources
679:
676:
673:
14:
581:may behave as either the process
1179:
1178:
645:for action names that appear in
30:
723:ipc: the imperial PEPA compiler
625:, and performs a silent action
317:reversed compound agent theorem
41:needs additional citations for
1185:Category: Concurrent computing
755:. Cambridge University Press.
536:{\displaystyle (a,\lambda ).P}
524:
512:
475:
453:
411:
391:
378:
366:
307:must co-operate on activities
175:continuous-time Markov process
1:
839:"ipc: Imperial PEPA Compiler"
1211:Theoretical computer science
567:and continue as the process
1146:Dining philosophers problem
873:10.1109/MASCOT.2003.1240679
1227:
1035:Concurrent data structures
783:"The PEPA Plug-in Project"
18:
1174:
1151:Producer–consumer problem
1136:Cigarette smokers problem
798:"The PEPA eclipse plugin"
193:in the style invented by
165:Rates are drawn from the
703:to refer to the process
560:{\displaystyle \lambda }
167:exponential distribution
1166:Sleeping barber problem
1161:Readers–writers problem
817:10.1145/1530873.1530880
1040:Concurrent hash tables
699:to use the identifier
693:
639:
561:
543:can perform an action
537:
489:
694:
640:
638:{\displaystyle \tau }
562:
538:
490:
334:} hides the activity
326:Finally, the process
191:operational semantics
1011:Concurrent computing
940:10.1109/QEST.2011.26
659:
629:
551:
509:
357:
50:improve this article
1030:Concurrency control
689:
683:
652:process identifier
635:
557:
533:
485:
431:
228:performs activity
181:, utilisation and
171:stochastic process
19:For the drug, see
1193:
1192:
949:978-1-4577-0973-9
717:PEPA Plug-in for
684:
671:
670:
443:
173:, specifically a
126:
125:
118:
100:
1218:
1182:
1181:
1124:Classic problems
1100:Ambient calculus
1047:Concurrent users
1004:
997:
990:
981:
962:
961:
927:
921:
920:
909:
903:
902:
862:
853:
847:
846:
843:www.doc.ic.ac.uk
835:
829:
828:
802:
793:
787:
786:
779:
773:
772:
770:
769:
754:
741:
698:
696:
695:
690:
685:
682:
666:
644:
642:
641:
636:
566:
564:
563:
558:
542:
540:
539:
534:
494:
492:
491:
486:
478:
467:
456:
445:
444:
442:
432:
430:
423:
414:
394:
121:
114:
110:
107:
101:
99:
58:
34:
26:
16:Process calculus
1226:
1225:
1221:
1220:
1219:
1217:
1216:
1215:
1206:Process calculi
1196:
1195:
1194:
1189:
1170:
1119:
1067:Process calculi
1061:
1057:Linearizability
1013:
1008:
971:
966:
965:
950:
934:. p. 147.
929:
928:
924:
917:code.google.com
911:
910:
906:
891:
867:. p. 344.
860:
855:
854:
850:
837:
836:
832:
800:
795:
794:
790:
781:
780:
776:
767:
765:
763:
743:
742:
738:
733:
714:
657:
656:
627:
626:
585:or the process
549:
548:
507:
506:
355:
354:
344:
140:process algebra
122:
111:
105:
102:
59:
57:
47:
35:
24:
17:
12:
11:
5:
1224:
1222:
1214:
1213:
1208:
1198:
1197:
1191:
1190:
1188:
1187:
1175:
1172:
1171:
1169:
1168:
1163:
1158:
1156:Race condition
1153:
1148:
1143:
1138:
1133:
1127:
1125:
1121:
1120:
1118:
1117:
1112:
1107:
1102:
1097:
1092:
1087:
1082:
1077:
1071:
1069:
1063:
1062:
1060:
1059:
1054:
1049:
1044:
1043:
1042:
1032:
1027:
1021:
1019:
1015:
1014:
1009:
1007:
1006:
999:
992:
984:
978:
977:
970:
969:External links
967:
964:
963:
948:
922:
904:
889:
848:
830:
788:
774:
761:
745:Hillston, Jane
735:
734:
732:
729:
728:
727:
724:
721:
713:
710:
709:
708:
688:
681:
678:
675:
669:
664:
653:
650:
634:
615:
612:
593:
590:
575:
572:
556:
532:
529:
526:
523:
520:
517:
514:
503:
496:
495:
484:
477:
470:
466:
462:
455:
448:
441:
436:
429:
420:
413:
406:
403:
400:
393:
386:
383:
380:
377:
374:
371:
368:
365:
362:
343:
340:
299:the processes
195:Gordon Plotkin
124:
123:
38:
36:
29:
15:
13:
10:
9:
6:
4:
3:
2:
1223:
1212:
1209:
1207:
1204:
1203:
1201:
1186:
1177:
1176:
1173:
1167:
1164:
1162:
1159:
1157:
1154:
1152:
1149:
1147:
1144:
1142:
1139:
1137:
1134:
1132:
1129:
1128:
1126:
1122:
1116:
1115:Join-calculus
1113:
1111:
1108:
1106:
1103:
1101:
1098:
1096:
1093:
1091:
1088:
1086:
1083:
1081:
1078:
1076:
1073:
1072:
1070:
1068:
1064:
1058:
1055:
1053:
1052:Indeterminacy
1050:
1048:
1045:
1041:
1038:
1037:
1036:
1033:
1031:
1028:
1026:
1023:
1022:
1020:
1016:
1012:
1005:
1000:
998:
993:
991:
986:
985:
982:
976:
973:
972:
968:
959:
955:
951:
945:
941:
937:
933:
926:
923:
918:
914:
908:
905:
900:
896:
892:
890:0-7695-2039-1
886:
882:
878:
874:
870:
866:
859:
852:
849:
844:
840:
834:
831:
826:
822:
818:
814:
810:
806:
799:
792:
789:
784:
778:
775:
764:
762:0-521-57189-8
758:
753:
752:
746:
740:
737:
730:
725:
722:
720:
716:
715:
711:
706:
702:
686:
667:
662:
654:
651:
648:
632:
624:
620:
616:
613:
610:
606:
602:
598:
594:
591:
588:
584:
580:
576:
573:
570:
554:
546:
530:
527:
521:
518:
515:
504:
501:
500:
499:
482:
468:
464:
460:
446:
439:
434:
427:
418:
404:
401:
398:
384:
381:
375:
372:
369:
363:
360:
353:
352:
351:
349:
341:
339:
337:
333:
329:
324:
322:
318:
314:
310:
306:
302:
298:
294:
290:
286:
281:
279:
275:
271:
267:
263:
259:
255:
251:
247:
243:
239:
235:
231:
227:
223:
219:
215:
211:
207:
203:
198:
196:
192:
188:
184:
183:response time
180:
176:
172:
168:
163:
161:
157:
153:
149:
145:
144:Jane Hillston
141:
138:
134:
130:
120:
117:
109:
98:
95:
91:
88:
84:
81:
77:
74:
70:
67: –
66:
62:
61:Find sources:
55:
51:
45:
44:
39:This article
37:
33:
28:
27:
22:
1109:
1105:API-Calculus
931:
925:
916:
907:
881:10044/1/5750
864:
851:
842:
833:
808:
804:
791:
777:
766:. Retrieved
750:
739:
704:
700:
646:
622:
618:
617:the process
608:
604:
600:
596:
586:
582:
578:
577:the process
568:
544:
505:the process
497:
345:
335:
331:
327:
325:
312:
308:
304:
300:
296:
292:
288:
284:
282:
277:
273:
269:
265:
261:
257:
253:
249:
245:
241:
237:
233:
229:
225:
221:
217:
213:
210:co-operation
209:
205:
201:
199:
164:
132:
128:
127:
112:
106:October 2018
103:
93:
86:
79:
72:
60:
48:Please help
43:verification
40:
1131:ABA problem
1025:Concurrency
592:cooperation
348:BNF grammar
21:PEPA (drug)
1200:Categories
1095:Ď€-calculus
768:2009-04-21
731:References
595:processes
179:throughput
137:stochastic
76:newspapers
811:(4): 28.
633:τ
555:λ
522:λ
440:◃
435:▹
376:λ
1141:Deadlock
958:10220707
747:(1996).
547:at rate
232:at rate
187:deadlock
1018:General
825:7715443
719:Eclipse
264:either
135:) is a
90:scholar
1183:
956:
946:
897:
887:
823:
759:
655:write
614:hiding
574:choice
502:action
342:Syntax
214:hiding
206:choice
202:prefix
148:Milner
92:
85:
78:
71:
65:"PEPA"
63:
1090:LOTOS
954:S2CID
899:97207
895:S2CID
861:(PDF)
821:S2CID
801:(PDF)
712:Tools
295:>
287:<
272:) or
156:Hoare
97:JSTOR
83:books
1110:PEPA
944:ISBN
885:ISBN
757:ISBN
599:and
311:and
303:and
212:and
154:and
133:PEPA
69:news
1085:ACP
1080:CCS
1075:CSP
936:doi
877:hdl
869:doi
813:doi
579:P+Q
364:::=
280:).
252:+ (
160:CSP
158:'s
152:CCS
150:'s
52:by
1202::
952:.
942:.
915:.
893:.
883:.
875:.
863:.
841:.
819:.
809:36
807:.
803:.
350::
330:/{
323:.
291:,
260:).
256:,
248:).
244:,
224:).
220:,
208:,
204:,
197:.
1003:e
996:t
989:v
960:.
938::
919:.
901:.
879::
871::
845:.
827:.
815::
785:.
771:.
707:.
705:P
701:A
687:P
680:f
677:e
674:d
668:=
663:A
649:.
647:L
623:L
619:P
609:L
605:L
601:Q
597:P
589:.
587:Q
583:P
571:.
569:P
545:a
531:P
528:.
525:)
519:,
516:a
513:(
483:A
476:|
469:L
465:/
461:P
454:|
447:Q
428:L
419:P
412:|
405:Q
402:+
399:P
392:|
385:P
382:.
379:)
373:,
370:a
367:(
361:P
336:a
332:a
328:P
313:b
309:a
305:Q
301:P
297:Q
293:b
289:a
285:P
278:Q
274:b
270:P
266:a
262:Q
258:s
254:b
250:P
246:r
242:a
238:P
234:r
230:a
226:P
222:r
218:a
131:(
119:)
113:(
108:)
104:(
94:·
87:·
80:·
73:·
46:.
23:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
