中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
decomposition of automata pdl and its extension
Author: Liu Xinxin ; Xue Bingtian
Source: Lecture Notes in Engineering and Computer Science
Conference Name: 2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012
Conference Date: March 14, 2012 - March 16, 2012
Issued Date: 2012
Conference Place: Kowloon, Hong kong
Keyword: Computer science ; Decomposition ; Specification languages
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
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
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].
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].
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/15854
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Liu Xinxin,Xue Bingtian. decomposition of automata pdl and its extension[C]. 见:2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012. Kowloon, Hong kong. March 14, 2012 - March 16, 2012.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Liu Xinxin]'s Articles
[Xue Bingtian]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Liu Xinxin]‘s Articles
[Xue Bingtian]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace