{"title":"并发进程的自同步","authors":"L. Jagadeesan, A. Meyer","doi":"10.1109/LICS.1993.287567","DOIUrl":null,"url":null,"abstract":"Introduces a unary \"self-synchronization\" operation on concurrent processes that synchronizes concurrent transitions within a process. Standard parallel synchronization and communicating action refinement operations can be reduced to simple combinations of self-synchronization and unsynchronized noncommunicating operations. Modifying familiar fully abstract process semantics, so that actions are replaced by action multisets (steps), typically yields semantics that are fully abstract for processes with self-synchronization.<<ETX>>","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"5 1","pages":"409-417"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Self-synchronization of concurrent processes\",\"authors\":\"L. Jagadeesan, A. Meyer\",\"doi\":\"10.1109/LICS.1993.287567\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Introduces a unary \\\"self-synchronization\\\" operation on concurrent processes that synchronizes concurrent transitions within a process. Standard parallel synchronization and communicating action refinement operations can be reduced to simple combinations of self-synchronization and unsynchronized noncommunicating operations. Modifying familiar fully abstract process semantics, so that actions are replaced by action multisets (steps), typically yields semantics that are fully abstract for processes with self-synchronization.<<ETX>>\",\"PeriodicalId\":6322,\"journal\":{\"name\":\"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"5 1\",\"pages\":\"409-417\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1993.287567\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1993.287567","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Introduces a unary "self-synchronization" operation on concurrent processes that synchronizes concurrent transitions within a process. Standard parallel synchronization and communicating action refinement operations can be reduced to simple combinations of self-synchronization and unsynchronized noncommunicating operations. Modifying familiar fully abstract process semantics, so that actions are replaced by action multisets (steps), typically yields semantics that are fully abstract for processes with self-synchronization.<>