{"title":"标准自动机网络与I/O自动机网络之间的关系","authors":"J. Lunze","doi":"10.1109/WODES.2008.4605983","DOIUrl":null,"url":null,"abstract":"The paper compares networks of standard automata and networks of I/O automata with respect to their modelling power for composite discrete-event systems. It shows the similarities and the differences of both modelling philosophies and proves for the parallel composition of standard automata that an equivalent network of I/O automata exists. The constructive proof shows the specific choice of the I/O automata that makes the state transition functions of both automata networks identical. Hence, both modelling approaches share the modelling power at least for the class of discrete-event systems considered in this paper.","PeriodicalId":105225,"journal":{"name":"2008 9th International Workshop on Discrete Event Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Relations between networks of standard automata and networks of I/O automata\",\"authors\":\"J. Lunze\",\"doi\":\"10.1109/WODES.2008.4605983\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper compares networks of standard automata and networks of I/O automata with respect to their modelling power for composite discrete-event systems. It shows the similarities and the differences of both modelling philosophies and proves for the parallel composition of standard automata that an equivalent network of I/O automata exists. The constructive proof shows the specific choice of the I/O automata that makes the state transition functions of both automata networks identical. Hence, both modelling approaches share the modelling power at least for the class of discrete-event systems considered in this paper.\",\"PeriodicalId\":105225,\"journal\":{\"name\":\"2008 9th International Workshop on Discrete Event Systems\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 9th International Workshop on Discrete Event Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WODES.2008.4605983\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 9th International Workshop on Discrete Event Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2008.4605983","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Relations between networks of standard automata and networks of I/O automata
The paper compares networks of standard automata and networks of I/O automata with respect to their modelling power for composite discrete-event systems. It shows the similarities and the differences of both modelling philosophies and proves for the parallel composition of standard automata that an equivalent network of I/O automata exists. The constructive proof shows the specific choice of the I/O automata that makes the state transition functions of both automata networks identical. Hence, both modelling approaches share the modelling power at least for the class of discrete-event systems considered in this paper.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
