%0 Journal Article
%T Consistency Between the Predicate μ-Calculus and Modal Graphs<br>谓词μ演算和模态图的语义一致性
%A LIU Jian
%A LIN Hui-Min
%A <br>刘剑
%A 林惠民
%J 软件学报
%D 2003
%I 
%X The modal graphs are effective graph forms for the predicate m-calculus. The consistency between the predicate m-calculus and the modal graphs is strictly established. Moreover, the relationship among the predicate m-calculus, nested predicate equations and the modal graphs is discussed in detail. An optimized transformation algorithm from predicate m-calculus formulae to nested predicate equations is presented.
%K fixed-point
%K predicate m-calculus
%K nested predicate equation
%K modal graph<br>不动点
%K 谓词μ演算
%K 嵌套谓词等式系
%K 模态图
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=D6D47D7001FE86C7&yid=D43C4A19B2EE3C0A&vid=F3583C8E78166B9E&iid=F3090AE9B60B7ED1&sid=711D1EBABC3BFF4F&eid=BCF7BCA77FA8F9BA&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=9