摘要
首先给出了量子最弱自由前置条件(weakest liberal precondition,简称wlp)wlp(A,B,C)-可交换的定义,研究了wlp(A,B,C)-可交换的充分必要条件;其次,得到了wlp不是良好的谓词转换,验证了wlp是比量子最弱前置条件(weakest precondition,简称wp)更弱的谓词转换,揭示了wlp和wp的本质区别;最后证明了wlp的序列合成、并行合成和块结构等性质.
First, the definition of quantum weakest liberal precondition (termed wlp) wlp (A,B,C)-commutativity is proposed, some necessary, and sufficient conditions of wlp (A,B,C)-commutativity are presented. Secondly, it has been shown that wlp is not a healthy predicate transformer: it is verified that wlp is a weaker predicate transformer than the quantum weakest precondition (termed wp). The essential differences of wlp and wp are disclosed. Finally, the properties for sequential composition, parallel composition and block structure of wlp are investigated.
出处
《软件学报》
EI
CSCD
北大核心
2013年第5期933-941,共9页
Journal of Software
基金
国家自然科学基金(11271237
61228305)
关键词
量子谓词
超算子
量子最弱自由前置条件
交换
quantum predicate
super-operator
quantum weakest liberal precondition
commutate