Institutional Repository
| decomposition of automata pdl and its extension | |
| Liu Xinxin; Xue Bingtian | |
| 2012 | |
| Conference Name | 2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012 |
| Source | Lecture Notes in Engineering and Computer Science |
| Pages | 305-310 |
| Conference Date | March 14, 2012 - March 16, 2012 |
| Conference Place | Kowloon, Hong kong |
| Indexed Type | EI |
| ISSN | 2078-0958 |
| ISBN | 9789881925114 |
| Department | (1) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences P.O. Box 8718 100190 Beijing China |
| English Abstract | 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]. |
| Keyword | Computer Science Decomposition Specification Languages |
| Sponsorship | IAENG Society of Artificial Intelligence; IAENG Society of Bioinformatics; IAENG Society of Computer Science; IAENG Society of Data Mining; IAENG Society of Electrical Engineering |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15854 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Liu Xinxin,Xue Bingtian. decomposition of automata pdl and its extension[C],2012:305-310. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment