Knowledge (XXG)

Actor model theory

Source πŸ“

22: 133:
Actors are the primitives that form the basis of the Actor model of concurrent digital computation. In response to a message that it receives, an Actor can make local decisions, create more Actors, send more messages, and designate how to respond to the next message received. Actor model theory
864:
However, we know from physics that infinite energy cannot be expended along a finite trajectory. Therefore, since the Actor model is based on physics, the Law of Finite Chains Between Events in the Combined Ordering was taken as an axiom of the Actor model.
146:
From the definition of an Actor, it can be seen that numerous events take place: local decisions, creating Actors, sending messages, receiving messages, and designating how to respond to the next message received.
499:
Proof. It is sufficient to show that there is an Actor computation that satisfies the previously stated laws but violates the Law of Finite Chains Between Events in the Combined Ordering.
830: 173:) is a fundamental ordering that models one event activating another (there must be energy flow in the message passing from an event to an event which it activates). 954: 950: 135: 1217: 294: 486:
However, surprisingly proved that the Law of Finite Chains Between Events in the Combined Ordering is independent of the previous laws,
39: 1227: 105: 406:
The combined ordering is relativistically invariant because it is the transitive closure of relativistically invariant orderings.
1033: 1022: 1013: 86: 1222: 971: 58: 43: 65: 119: 72: 976: 32: 966: 495:
The Law of Finite Chains Between Events in the Combined Ordering does not follow from the previously stated laws.
1029:
Proceedings of the Symposium on Artificial Intelligence Programming Languages. SIGPLAN Notices 12, August 1977.
934: 54: 774:
Furthermore all of the laws stated before the Law of Strict Causality for the Combined Ordering are satisfied.
938: 873:
The Law of Finite Chains Between Events in the Combined Ordering is closely related to the following law:
916:
The Law of Discreteness is equivalent to the Law of Finite Chains Between Events in the Combined Ordering
286: 150:
However, this article focuses on just those events that are the arrival of a message sent to an Actor.
1019:
Proceeding of IFIP Working Conference on Formal Description of Programming Concepts. August 1–5, 1977.
1188:
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), Nicosia, Cyprus, March 14–17, 2004.
1201: 182: 1081:
Proceedings of First International Conference on Distributed Systems Huntsville, AL. October 1979.
1044:
Specification and Verification Techniques for Parallel Programs Based on Message Passing Semantics
134:
incorporates theories of the events and structures of Actor computations, their proof theory, and
399: 226: 179: 937:. The combined ordering is used by in the construction of a denotational model of Actors (see 79: 815: 1153: 1181:
International Conference on Algebraic Methodology and Software Technology (AMAST), 2004.
995:
Conference Record of ACM Symposium on Principles of Programming Languages, January 1974.
1211: 293:. The arrival ordering means that the Actor model inherently has indeterminacy (see 777:
However, there may be an infinite number of events in the combined ordering between
1158:
Analysis of inheritance anomaly in object-oriented concurrent programming languages
923: 953:. Subsequently Hewitt augmented the diagrams with arrival times to construct a 477:, linearly ordered sets) of events between two events in the combined ordering β†’. 482:
Independence of the Law of Finite Chains Between Events in the Combined Ordering
127: 21: 290: 1119: 927: 466:
In , it was conjectured that the above laws might entail the following law:
1160:
in Research directions in concurrent object-oriented programming. 1993.
285:
in processing messages (often making use of a digital circuit called an
277:) models the (total) ordering of events in which a message arrives at 1131: 402:
of the activation ordering and the arrival orderings of all Actors.
1192: 1179:
Techniques for Executing and Reasoning About Specification Diagrams
949:
Clinger used the Actor event model described above to construct a
1095:
IEEE Transactions on Systems, Man, and Cybernetics. January 1981.
177:
Because of the transmission of energy, the activation ordering is
1132:
Actors: A Model of Concurrent Computation in Distributed Systems
910:
In fact the previous two laws have been shown to be equivalent:
1051:
Very Large Address Space Modularly Extensible Computer Systems
301:
Because all of the events of the arrival ordering of an actor
15: 463:
The combined ordering is obviously transitive by definition.
471:
Law of Finite Chains Between Events in the Combined Ordering
1170:
Luca de Alfaro, Zohar Manna, Henry Sipma and TomΓ‘s Uribe.
1058:
Viewing Control Structures as Patterns of Passing Messages
153:
This article reports on the results published in Hewitt .
449:
in the relativistic frames of reference of all observers.
360:
in the relativistic frames of reference of all observers.
1145:
Gul Agha, Ian Mason, Scott Smith, and Carolyn Talcott.
1202:
What is Commitment?Physical, Organizational, and Social
1140:
Sequential and Concurrent Behaviour in Petri Net Theory
1100:
Reasoning about Change in Knowledgeable Office Systems
1124:
Concurrent Behaviour: Sequences, Processes and Axioms
818: 243:
Law of Finite Predecession in the Activation Ordering
1074:
IEEE Journal on Software Engineering. January 1979.
233:
Law of Strict Causality for the Activation Ordering
46:. Unsourced material may be challenged and removed. 1077:Carl Hewitt, Beppe Attardi, and Henry Lieberman. 1072:Specification and Proof Techniques for Serializers 824: 503:Consider a computation which begins when an actor 1116:MIT Mathematics Doctoral Dissertation. June 1981. 951:denotational model for Actors using power domains 511:message causing it to take the following actions 453:Law of Strict Causality for the Combined Ordering 1177:Thati, Prasanna, Carolyn Talcott, and Gul Agha. 1149:Journal of Functional Programming January 1993. 933:The Law of Discreteness implies the property of 1167:Journal of Computer Software Engineering. 1995. 1126:Lecture Notes in Computer Science Vol.197 1984. 1027:The Incremental Garbage Collection of Processes 364:Law of Finite Predecession in Arrival Orderings 1060:Journal of Artificial Intelligence. June 1977. 1046:MIT EECS Doctoral Dissertation. December 1977. 1067:MIT EECS Doctoral Dissertation. January 1978. 1002:MIT EECS Doctoral Dissertation. August 1975. 1000:Semantics of Communicating Parallel Processes 289:). The arrival events of an Actor are on its 8: 1142:Theoretical Computer Science Vol.55/1. 1987. 1109:MIT EECS Doctoral Dissertation. August 1981. 1102:MIT EECS Doctoral Dissertation. August 1981. 1165:A Logic for concurrent programming: Safety 1053:MIT EECS Doctoral Dissertation. June 1977. 160:: There are at most countably many events. 1184:Giuseppe Milicia and Vladimiro Sassone. 1037:Laws for Communicating Parallel Processes 817: 106:Learn how and when to remove this message 1186:The Inheritance Anomaly: Ten Years After 1172:Visual Verification of Reactive Systems 1065:Actor Systems for Real-Time Computation 295:Indeterminacy in concurrent computation 1088:MIT Doctoral Dissertation. June, 1980. 955:technically simpler denotational model 681:message (which we will call the event 309:, the arrival ordering of an actor is 1086:Automatic Verification of Serializers 281:. Arrival ordering is determined by 7: 918:(without using the axiom of choice.) 126:concerns theoretical issues for the 44:adding citations to reliable sources 993:Actor Induction and Meta-evaluation 1194:Zeno machines and hypercomputation 1147:A Foundation for Actor Computation 922:The law of discreteness rules out 819: 394:The combined ordering (denoted by 14: 1093:The Scientific Community Metaphor 1017:Actors and Continuous Functionals 473:: There are no infinite chains ( 269:The arrival ordering of an Actor 1091:Bill Kornfeld and Carl Hewitt. 1070:Carl Hewitt and Russ Atkinson. 20: 972:Actor model and process calculi 559:is as follows on receipt of an 31:needs additional citations for 1218:Actor model (computer science) 1114:Foundations of Actor Semantics 1107:Parallelism in Problem Solving 957:that is easier to understand. 655:(which we will call the event 570:(which we will call the event 1: 1135:Doctoral Dissertation. 1986. 1079:Delegation in Message Passing 926:and is related to results on 621:Obviously the computation of 305:happen on the world line of 120:theoretical computer science 1138:Eike Best and R.Devillers. 1007:A discipline of programming 644:When it receives a message 634:The behavior of each Actor 555:Thereafter the behavior of 1244: 977:Actor model implementation 629:messages never terminates. 589:which is sent the message 521:which is sent the message 311:relativistically invariant 186:; that is, for all events 142:Events and their orderings 967:Actor model early history 753:every time and therefore 718:every time and therefore 169:The activation ordering ( 1228:Mathematics of computing 935:unbounded nondeterminism 695:Now it is possible that 825:{\displaystyle \infty } 398:) is defined to be the 1223:Denotational semantics 945:Denotational semantics 939:denotational semantics 826: 218:precedes the time of 1152:Satoshi Matsuoka and 1039:IFIP-77, August 1977. 827: 563:message with address 455:: For no event does 442:precedes the time of 353:precedes the time of 235:: For no event does 1009:Prentice Hall. 1976. 816: 610:with the address of 542:with the address of 525:with the address of 225:in the relativistic 55:"Actor model theory" 40:improve this article 1204:COINS@AAMAS. 2006. 878:Law of Discreteness 869:Law of Discreteness 690:), it does nothing. 677:When it receives a 582:Create a new actor 514:Create a new actor 435:. then the time of 346:, then the time of 227:frames of reference 211:, then the time of 165:Activation ordering 158:Law of Countability 136:denotational models 1191:Petrus Potgieter. 880:: For all events 822: 400:transitive closure 366:: For all events 245:: For all events 124:Actor model theory 1005:Edsger Dijkstra. 410:, for all events 390:Combined ordering 317:, for all actors 265:Arrival orderings 229:of all observers. 116: 115: 108: 90: 1235: 1163:Jayadev Misra. 1154:Akinori Yonezawa 1105:Bill Kornfeld. 1084:Russ Atkinson. 1032:Carl Hewitt and 1025:and Carl Hewitt 1012:Carl Hewitt and 905: 893: 886: 860: 831: 829: 828: 823: 794: 785: 768: 752: 733: 717: 689: 680: 667: 663: 647: 628: 609: 592: 578: 562: 541: 524: 510: 458: 448: 441: 434: 423: 416: 397: 384: 376: 372: 359: 352: 345: 334: 327: 320: 308: 304: 280: 276: 272: 259: 251: 238: 224: 217: 210: 199: 192: 180:relativistically 172: 111: 104: 100: 97: 91: 89: 48: 24: 16: 1243: 1242: 1238: 1237: 1236: 1234: 1233: 1232: 1208: 1207: 1112:Will Clinger. 1098:Gerry Barber. 985: 963: 947: 903: 899: 895: 892: 888: 885: 881: 871: 858: 851: 844: 837: 814: 813: 810: 803: 798: 792: 787: 783: 778: 766: 759: 754: 750: 743: 738: 731: 724: 719: 715: 708: 701: 696: 687: 682: 678: 673: 665: 661: 656: 653: 645: 641:is as follows: 639: 626: 625:sending itself 615: 607: 598: 590: 587: 576: 571: 568: 560: 547: 539: 530: 522: 519: 508: 484: 456: 447: 443: 440: 436: 433: 429: 425: 422: 418: 415: 411: 395: 392: 382: 378: 374: 371: 367: 358: 354: 351: 347: 344: 340: 336: 333: 329: 326: 322: 318: 306: 302: 278: 274: 270: 267: 257: 253: 250: 246: 236: 223: 219: 216: 212: 209: 205: 201: 198: 194: 191: 187: 170: 167: 144: 112: 101: 95: 92: 49: 47: 37: 25: 12: 11: 5: 1241: 1239: 1231: 1230: 1225: 1220: 1210: 1209: 1206: 1205: 1198: 1189: 1182: 1175: 1168: 1161: 1150: 1143: 1136: 1127: 1117: 1110: 1103: 1096: 1089: 1082: 1075: 1068: 1061: 1054: 1047: 1040: 1030: 1020: 1010: 1003: 998:Irene Greif. 996: 984: 981: 980: 979: 974: 969: 962: 959: 946: 943: 920: 919: 908: 907: 901: 897: 890: 883: 870: 867: 862: 861: 856: 849: 842: 835: 821: 808: 801: 796: 790: 781: 775: 771: 770: 764: 757: 748: 741: 735: 729: 722: 713: 706: 699: 693: 692: 691: 685: 675: 671: 664:), it sends a 659: 651: 637: 631: 630: 619: 618: 617: 613: 600: 596: 585: 574: 566: 552: 551: 550: 549: 545: 532: 528: 517: 483: 480: 479: 478: 461: 460: 450: 445: 438: 431: 427: 420: 413: 391: 388: 387: 386: 380: 369: 361: 356: 349: 342: 338: 331: 324: 266: 263: 262: 261: 255: 248: 240: 230: 221: 214: 207: 203: 196: 189: 166: 163: 162: 161: 143: 140: 114: 113: 28: 26: 19: 13: 10: 9: 6: 4: 3: 2: 1240: 1229: 1226: 1224: 1221: 1219: 1216: 1215: 1213: 1203: 1199: 1196: 1195: 1190: 1187: 1183: 1180: 1176: 1173: 1169: 1166: 1162: 1159: 1155: 1151: 1148: 1144: 1141: 1137: 1134: 1133: 1128: 1125: 1121: 1118: 1115: 1111: 1108: 1104: 1101: 1097: 1094: 1090: 1087: 1083: 1080: 1076: 1073: 1069: 1066: 1063:Henry Baker. 1062: 1059: 1056:Carl Hewitt. 1055: 1052: 1049:Peter Bishop 1048: 1045: 1042:Aki Yonezawa 1041: 1038: 1035: 1031: 1028: 1024: 1021: 1018: 1015: 1011: 1008: 1004: 1001: 997: 994: 991: 988:Carl Hewitt, 987: 986: 982: 978: 975: 973: 970: 968: 965: 964: 960: 958: 956: 952: 944: 942: 940: 936: 931: 929: 925: 924:Zeno machines 917: 913: 912: 911: 879: 876: 875: 874: 868: 866: 859: 852: 845: 838: 811: 804: 797: 793: 784: 776: 773: 772: 767: 760: 751: 744: 736: 732: 725: 716: 709: 702: 694: 688: 676: 674: 662: 654: 648:with address 643: 642: 640: 633: 632: 624: 620: 616: 605: 601: 599: 593:with address 588: 581: 580: 577: 569: 558: 554: 553: 548: 537: 533: 531: 520: 513: 512: 506: 502: 501: 500: 497: 496: 491: 489: 481: 476: 472: 469: 468: 467: 464: 454: 451: 409: 405: 404: 403: 401: 389: 365: 362: 316: 312: 300: 299: 298: 296: 292: 288: 284: 264: 244: 241: 234: 231: 228: 185: 184: 181: 176: 175: 174: 164: 159: 156: 155: 154: 151: 148: 141: 139: 137: 131: 129: 125: 121: 110: 107: 99: 88: 85: 81: 78: 74: 71: 67: 64: 60: 57: β€“  56: 52: 51:Find sources: 45: 41: 35: 34: 29:This article 27: 23: 18: 17: 1200:Carl Hewitt 1193: 1185: 1178: 1171: 1164: 1157: 1146: 1139: 1130: 1123: 1113: 1106: 1099: 1092: 1085: 1078: 1071: 1064: 1057: 1050: 1043: 1036: 1026: 1016: 1006: 999: 992: 989: 948: 932: 921: 915: 909: 877: 872: 863: 854: 847: 840: 833: 806: 799: 788: 779: 762: 755: 746: 739: 727: 720: 711: 704: 697: 683: 669: 657: 649: 635: 622: 611: 606:the message 603: 594: 583: 572: 564: 556: 543: 538:the message 535: 526: 515: 504: 498: 494: 492: 487: 485: 474: 470: 465: 462: 452: 407: 393: 363: 314: 310: 282: 268: 242: 232: 178: 168: 157: 152: 149: 145: 132: 123: 117: 102: 93: 83: 76: 69: 62: 50: 38:Please help 33:verification 30: 1174:TACAS 1997. 1129:Gul Agha. 1034:Henry Baker 1023:Henry Baker 1014:Henry Baker 914:Theorem . 795:as follows: 668:message to 373:and Actors 321:and events 283:arbitration 128:Actor model 96:August 2011 1212:Categories 983:References 928:Petri nets 906:is finite. 894:, the set 855:SayHelloTo 841:SayHelloTo 789:SayHelloTo 728:SayHelloTo 712:SayHelloTo 658:SayHelloTo 646:SayHelloTo 591:SayHelloTo 523:SayHelloTo 507:is sent a 493:Theorem. 385:is finite. 379:{e|e -xβ†’ e 291:world line 260:is finite. 254:{e|e -β‰ˆβ†’ e 66:newspapers 1120:Eike Best 820:∞ 183:invariant 961:See also 377:the set 252:the set 705:Greeter 670:Greeter 650:Greeter 636:Greeter 623:Initial 612:Greeter 604:Initial 595:Greeter 584:Greeter 565:Greeter 557:Initial 544:Greeter 536:Initial 527:Greeter 516:Greeter 505:Initial 287:arbiter 237:e -β‰ˆβ†’ e 80:scholar 990:et al. 82:  75:  68:  61:  53:  848:Hello 846:β†’...β†’ 834:Hello 807:Again 805:β†’...β†’ 800:Again 780:Again 763:Again 756:Again 747:Again 740:Again 737:Also 721:Hello 698:Hello 684:Hello 679:Hello 666:Hello 627:Again 608:Again 602:Send 573:Again 561:Again 540:Again 534:Send 509:Start 424:, if 341:-xβ†’ e 335:, if 206:-β‰ˆβ†’ e 200:, if 87:JSTOR 73:books 1197:2005 900:β†’eβ†’e 896:{e|e 887:and 832:...β†’ 812:β†’... 786:and 745:-β‰ˆβ†’ 488:i.e. 475:i.e. 408:I.e. 315:I.e. 275:-xβ†’ 59:news 1156:. 941:). 765:i+1 749:i+1 672:i-1 652:i-1 614:i+1 586:i+1 579:): 457:eβ†’e 297:). 171:-β‰ˆβ†’ 118:In 42:by 1214:: 1122:. 930:. 761:β†’ 710:β†’ 490:, 430:β†’e 313:. 273:( 138:. 130:. 122:, 904:} 902:2 898:1 891:2 889:e 884:1 882:e 857:1 853:β†’ 850:1 843:i 839:β†’ 836:i 809:i 802:1 791:1 782:1 769:. 758:i 742:i 734:. 730:i 726:β†’ 723:i 714:i 707:i 703:- 700:i 686:i 660:i 638:i 597:i 575:i 567:i 546:1 529:1 518:1 459:. 446:2 444:e 439:1 437:e 432:2 428:1 426:e 421:2 419:e 417:. 414:1 412:e 396:β†’ 383:} 381:1 375:x 370:1 368:e 357:2 355:e 350:1 348:e 343:2 339:1 337:e 332:2 330:e 328:. 325:1 323:e 319:x 307:x 303:x 279:x 271:x 258:} 256:1 249:1 247:e 239:. 222:2 220:e 215:1 213:e 208:2 204:1 202:e 197:2 195:e 193:. 190:1 188:e 109:) 103:( 98:) 94:( 84:Β· 77:Β· 70:Β· 63:Β· 36:.

Index


verification
improve this article
adding citations to reliable sources
"Actor model theory"
news
newspapers
books
scholar
JSTOR
Learn how and when to remove this message
theoretical computer science
Actor model
denotational models
relativistically
invariant
frames of reference
arbiter
world line
Indeterminacy in concurrent computation
transitive closure
Zeno machines
Petri nets
unbounded nondeterminism
denotational semantics
denotational model for Actors using power domains
technically simpler denotational model
Actor model early history
Actor model and process calculi
Actor model implementation

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑