{"title":"从用LOTOS编写的正式协议规范派生可执行代码","authors":"A. Valenzano, R. Sisto, L. Ciminiera","doi":"10.1109/PCCC.1991.113832","DOIUrl":null,"url":null,"abstract":"A novel tool for generating implementation prototypes of communication protocols and concurrent systems specified using the ISO LOTOS language is presented. LOTOS specifications are analyzed and translated into C functions that are executed by cooperating processes in the UNIX environment. The set of LOTOS process definitions is first translated into a suitable number of extended finite state machines (EFSMs). The proposed method makes it possible to circumvent the problem of deriving unbounded EFSMs and to obtain a sort of control on the process number/size tradeoff at the same time. The problem of implementing the LOTOS multi-way rendezvous mechanism for process synchronization is solved by an algorithm based on message passing. An example of prototype derivation is also introduced showing the form of C code generated by translating a simple specification.<<ETX>>","PeriodicalId":270677,"journal":{"name":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Derivation of executable code from formal protocol specifications written in LOTOS\",\"authors\":\"A. Valenzano, R. Sisto, L. Ciminiera\",\"doi\":\"10.1109/PCCC.1991.113832\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel tool for generating implementation prototypes of communication protocols and concurrent systems specified using the ISO LOTOS language is presented. LOTOS specifications are analyzed and translated into C functions that are executed by cooperating processes in the UNIX environment. The set of LOTOS process definitions is first translated into a suitable number of extended finite state machines (EFSMs). The proposed method makes it possible to circumvent the problem of deriving unbounded EFSMs and to obtain a sort of control on the process number/size tradeoff at the same time. The problem of implementing the LOTOS multi-way rendezvous mechanism for process synchronization is solved by an algorithm based on message passing. An example of prototype derivation is also introduced showing the form of C code generated by translating a simple specification.<<ETX>>\",\"PeriodicalId\":270677,\"journal\":{\"name\":\"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1991.113832\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1991.113832","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Derivation of executable code from formal protocol specifications written in LOTOS
A novel tool for generating implementation prototypes of communication protocols and concurrent systems specified using the ISO LOTOS language is presented. LOTOS specifications are analyzed and translated into C functions that are executed by cooperating processes in the UNIX environment. The set of LOTOS process definitions is first translated into a suitable number of extended finite state machines (EFSMs). The proposed method makes it possible to circumvent the problem of deriving unbounded EFSMs and to obtain a sort of control on the process number/size tradeoff at the same time. The problem of implementing the LOTOS multi-way rendezvous mechanism for process synchronization is solved by an algorithm based on message passing. An example of prototype derivation is also introduced showing the form of C code generated by translating a simple specification.<>