CORC  > 软件研究所  > 软件所图书馆  > 会议论文
specification in pdl with recursion
Liu Xinxin ; Xue Bingtian
2012
会议名称4th NASA Formal Methods Symposium, NFM 2012
会议日期April 3, 2012 - April 5, 2012
会议地点Norfolk, VA, United states
关键词Calculations NASA Specifications
页码181-194
中文摘要By extending regular Propositional Dynamic Logic (PDL) with simple recursive propositions, we obtain a language which has enough expressiveness to allow interesting applications while still enjoying a relatively simple decision procedure. More specifically, it is strictly more expressive than the regular PDL and not more expressive than the single alternation fragment of the modal μ-calculus. We present a decision procedure for satisfiability of a large class of so called simple formulas. The decision procedure has a time complexity which is polynomial in the size of the programs and exponential in the number of the sub-formulas. We show a way to solve process equations of weak bisimulation as an application. © 2012 Springer-Verlag.
英文摘要By extending regular Propositional Dynamic Logic (PDL) with simple recursive propositions, we obtain a language which has enough expressiveness to allow interesting applications while still enjoying a relatively simple decision procedure. More specifically, it is strictly more expressive than the regular PDL and not more expressive than the single alternation fragment of the modal μ-calculus. We present a decision procedure for satisfiability of a large class of so called simple formulas. The decision procedure has a time complexity which is polynomial in the size of the programs and exponential in the number of the sub-formulas. We show a way to solve process equations of weak bisimulation as an application. © 2012 Springer-Verlag.
收录类别EI
会议录Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
语种英语
ISSN号0302-9743
ISBN号9783642288906
内容类型会议论文
源URL[http://ir.iscas.ac.cn/handle/311060/15703]  
专题软件研究所_软件所图书馆_会议论文
推荐引用方式
GB/T 7714
Liu Xinxin,Xue Bingtian. specification in pdl with recursion[C]. 见:4th NASA Formal Methods Symposium, NFM 2012. Norfolk, VA, United states. April 3, 2012 - April 5, 2012.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace