{"title":"时间状态机与安全TPN的等价性","authors":"S. Haar, L. Kaiser, F. Simonot-Lion, J. Toussaint","doi":"10.1109/WODES.2002.1167678","DOIUrl":null,"url":null,"abstract":"We show that an important subclass of timed automata (Alur and Dill, 1994), called timed state machines, is weakly time equivalent to safe non-zero time Petri nets (TPNs) in the sense of Merlin and Farber (1976). We present an explicit construction for two-way translation between 1-safe TPNs and TSMs. The translation improves on the efficiency of other methods: the TSM obtained for a given net is polynomial in the size of the reachability graph, and a given TSM is translated into a net whose size grows linearly with that of the automaton model.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Equivalence of timed state machines and safe TPN\",\"authors\":\"S. Haar, L. Kaiser, F. Simonot-Lion, J. Toussaint\",\"doi\":\"10.1109/WODES.2002.1167678\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that an important subclass of timed automata (Alur and Dill, 1994), called timed state machines, is weakly time equivalent to safe non-zero time Petri nets (TPNs) in the sense of Merlin and Farber (1976). We present an explicit construction for two-way translation between 1-safe TPNs and TSMs. The translation improves on the efficiency of other methods: the TSM obtained for a given net is polynomial in the size of the reachability graph, and a given TSM is translated into a net whose size grows linearly with that of the automaton model.\",\"PeriodicalId\":435263,\"journal\":{\"name\":\"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WODES.2002.1167678\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2002.1167678","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We show that an important subclass of timed automata (Alur and Dill, 1994), called timed state machines, is weakly time equivalent to safe non-zero time Petri nets (TPNs) in the sense of Merlin and Farber (1976). We present an explicit construction for two-way translation between 1-safe TPNs and TSMs. The translation improves on the efficiency of other methods: the TSM obtained for a given net is polynomial in the size of the reachability graph, and a given TSM is translated into a net whose size grows linearly with that of the automaton model.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
