Institutional Repository
| decomposition of automata pdl and its extension | |
| Liu Xinxin; Xue Bingtian | |
| 2012 | |
| 会议名称 | 2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012 |
| 会议录名称 | Lecture Notes in Engineering and Computer Science |
| 页码 | 305-310 |
| 会议日期 | March 14, 2012 - March 16, 2012 |
| 会议地点 | Kowloon, Hong kong |
| 收录类别 | EI |
| ISSN | 2078-0958 |
| ISBN | 9789881925114 |
| 部门归属 | (1) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences P.O. Box 8718 100190 Beijing China |
| 摘要 | In this work we study the decomposition problem of automata PDL and one of its extension. We proved that automata PDL enjoys a good decomposition property under a very large class of process context, while this problem is more complicated for regular PDL, which has an exponential blow-up. We introduce proposition identifiers to automata PDL to obtain a language which has a good balance between expressiveness and ease of analysis. We prove that this extended specification language still has a good decomposition property for a large class of process contexts. After that we present a method to solve the weak bisimulation equations as an application of the extended language, by combining the decomposition property and the decision procedure proposed in [1].; In this work we study the decomposition problem of automata PDL and one of its extension. We proved that automata PDL enjoys a good decomposition property under a very large class of process context, while this problem is more complicated for regular PDL, which has an exponential blow-up. We introduce proposition identifiers to automata PDL to obtain a language which has a good balance between expressiveness and ease of analysis. We prove that this extended specification language still has a good decomposition property for a large class of process contexts. After that we present a method to solve the weak bisimulation equations as an application of the extended language, by combining the decomposition property and the decision procedure proposed in [1]. |
| 关键词 | Computer Science Decomposition Specification Languages |
| 主办者 | IAENG Society of Artificial Intelligence; IAENG Society of Bioinformatics; IAENG Society of Computer Science; IAENG Society of Data Mining; IAENG Society of Electrical Engineering |
| 语种 | 英语 |
| 内容类型 | 会议论文 |
| URI标识 | http://ir.iscas.ac.cn/handle/311060/15854 |
| 专题 | 中国科学院软件研究所 |
| 推荐引用方式 GB/T 7714 | Liu Xinxin,Xue Bingtian. decomposition of automata pdl and its extension[C],2012:305-310. |
| 条目包含的文件 | 条目无相关文件。 | |||||
| 个性服务 |
| 推荐该条目 |
| 保存到收藏夹 |
| 查看访问统计 |
| 导出为Endnote文件 |
| 谷歌学术 |
| 谷歌学术中相似的文章 |
| [Liu Xinxin]的文章 |
| [Xue Bingtian]的文章 |
| 百度学术 |
| 百度学术中相似的文章 |
| [Liu Xinxin]的文章 |
| [Xue Bingtian]的文章 |
| 必应学术 |
| 必应学术中相似的文章 |
| [Liu Xinxin]的文章 |
| [Xue Bingtian]的文章 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论