{"title":"多智能体生产系统的事务模型","authors":"T. Ishida","doi":"10.1109/CAIA.1992.200043","DOIUrl":null,"url":null,"abstract":"A transaction model for multiagent production systems communicating through shared working memory is proposed. To realize arbitrary interleaved rule firings of multiple agents, each transaction is formed when a rule is selected for firing. An efficient concurrency control protocol, called the lazy lock protocol, is introduced to guarantee the serializability of rule firings. As a result of allowing interleaved rule firings, however, ensuring the serializability becomes no longer enough to guarantee the consistency of the shared working memory. A logical dependency model and its maintenance mechanisms are thus introduced to overcome this problem.<<ETX>>","PeriodicalId":388685,"journal":{"name":"Proceedings Eighth Conference on Artificial Intelligence for Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A transaction model for multiagent production systems\",\"authors\":\"T. Ishida\",\"doi\":\"10.1109/CAIA.1992.200043\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A transaction model for multiagent production systems communicating through shared working memory is proposed. To realize arbitrary interleaved rule firings of multiple agents, each transaction is formed when a rule is selected for firing. An efficient concurrency control protocol, called the lazy lock protocol, is introduced to guarantee the serializability of rule firings. As a result of allowing interleaved rule firings, however, ensuring the serializability becomes no longer enough to guarantee the consistency of the shared working memory. A logical dependency model and its maintenance mechanisms are thus introduced to overcome this problem.<<ETX>>\",\"PeriodicalId\":388685,\"journal\":{\"name\":\"Proceedings Eighth Conference on Artificial Intelligence for Applications\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth Conference on Artificial Intelligence for Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CAIA.1992.200043\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth Conference on Artificial Intelligence for Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAIA.1992.200043","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A transaction model for multiagent production systems
A transaction model for multiagent production systems communicating through shared working memory is proposed. To realize arbitrary interleaved rule firings of multiple agents, each transaction is formed when a rule is selected for firing. An efficient concurrency control protocol, called the lazy lock protocol, is introduced to guarantee the serializability of rule firings. As a result of allowing interleaved rule firings, however, ensuring the serializability becomes no longer enough to guarantee the consistency of the shared working memory. A logical dependency model and its maintenance mechanisms are thus introduced to overcome this problem.<>