{"title":"具有图形重写的actor的规范和实现","authors":"J. Loyall, S. Kaplan, S. K. Goering","doi":"10.1145/127056.127088","DOIUrl":null,"url":null,"abstract":"We are investigating the use of graph rewriting for the specification and implementation of object-based concurrent systems. Graph rewriting is a powerful framework in which to specify and implement such systems because the visual, graph-based notation more closely fits the programmer's visual image of object-based concurrent systems than textual notation, an image in which objects are represented as nodes or clusters of nodes in a graph and communication links are represented as edges in the same graph, and graph-rewriting presents an efficient implementation of object-based concurrent systems.","PeriodicalId":135062,"journal":{"name":"OOPSLA/ECOOP '90","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Specification and implementation of Actors with graph rewriting\",\"authors\":\"J. Loyall, S. Kaplan, S. K. Goering\",\"doi\":\"10.1145/127056.127088\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We are investigating the use of graph rewriting for the specification and implementation of object-based concurrent systems. Graph rewriting is a powerful framework in which to specify and implement such systems because the visual, graph-based notation more closely fits the programmer's visual image of object-based concurrent systems than textual notation, an image in which objects are represented as nodes or clusters of nodes in a graph and communication links are represented as edges in the same graph, and graph-rewriting presents an efficient implementation of object-based concurrent systems.\",\"PeriodicalId\":135062,\"journal\":{\"name\":\"OOPSLA/ECOOP '90\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"OOPSLA/ECOOP '90\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/127056.127088\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"OOPSLA/ECOOP '90","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/127056.127088","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Specification and implementation of Actors with graph rewriting
We are investigating the use of graph rewriting for the specification and implementation of object-based concurrent systems. Graph rewriting is a powerful framework in which to specify and implement such systems because the visual, graph-based notation more closely fits the programmer's visual image of object-based concurrent systems than textual notation, an image in which objects are represented as nodes or clusters of nodes in a graph and communication links are represented as edges in the same graph, and graph-rewriting presents an efficient implementation of object-based concurrent systems.