检索结果-内蒙古大学图书馆

A clausal resolution method for branching-time logic ECTL⁺

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2006年第3期46卷 235-263页

作者： Bolotov, Alexander Basukoski, Artie Univ Westminster Harrow Sch Comp Sci London HA1 3TP England

We expand the applicability of the clausal resolution technique to the branching-time temporal logic ECTL+. ECTL+ is strictly more expressive than the basic computation tree logic CTL and its extension, ECTL, as it allows Boolean combinations of fairness and single temporal operators. We show how any ECTL+ formula can be translated to a normal form the structure of which was initially defined for CTL and then used for ECTL. This enables us to apply to ECTL+ a resolution technique defined over the set of clauses. Both correctness of the method and complexity of the transformation procedure are given.

关键词： automated deduction branching-time logic program specification and verification resolution

来源：评论

学校读者我要写书评

暂无评论

A clausal resolution method for CTL branching-time temporal logic

引用

JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE 1999年第1期11卷 77-93页

作者： Bolotov, A Fisher, M Manchester Metropolitan Univ Dept Comp & Math Manchester M1 5GD Lancs England

In this paper we extend our clausal resolution method for linear time temporal logics to a branching-time framework. Thus, we propose an efficient deductive method useful in a variety of applications requiring an expressive branching-time temporal logic in AI. The branching-time temporal logic considered is Computation Tree Logic (CTL), often regarded as the simplest useful logic of this class. The key elements of the resolution method, namely the normal form, the concept of step resolution and a novel temporal resolution rule, are introduced and justified with respect to this logic. A completeness argument is provided, together with some examples of the use of the temporal resolution method. Finally, we consider future work, in particular the extension of the method yet further, to Extended CTL (ECTL), which is CTL extended with fairness operators, and CTL*, the most powerful logic of this class. We will also outline possible implementation of the approach by adapting techniques developed for linear-time temporal resolution.

关键词： branching-time automated deduction resolution program specification and verification

来源：评论

学校读者我要写书评

暂无评论

Proof abstraction for imperative languages

引用

4th Asian Symposium on programming Languages and Systems

作者： Harrison, William L. Univ Missouri Dept Comp Sci Columbia MO 65211 USA

ISBN: (纸本)3540489371

Modularity in programming language semantics derives from abstracting over the structure of underlying denotations, yielding semantic descriptions that are more abstract and reusable. One such semantic framework is Liang's modular monadic semantics in which the underlying semantic structure is encapsulated with a monad. Such abstraction can be at odds with program verification, however, because program specifications require access to the (deliberately) hidden semantic representation. The techniques for reasoning about modular monadic definitions of imperative programs introduced here overcome this barrier. And, just like program definitions in modular monadic semantics, our program specifications and proofs are representation-independent and hold for whole classes of monads, thereby yielding proofs of great generality.

关键词： monads monad transformers language semantics program specification and verification

来源：评论

学校读者我要写书评

暂无评论

Efficient scaling-invariant checking of timed bisimulation 14th

引用

14th Annual Symposium on Theoretical Aspects of Computer Science (STACS 97)

作者： Weise, C Lenzkes, D Aachen Tech Univ Lehrstuhl Informat 1 Aachen Germany

ISBN: (纸本)3540626166

Bisimulation is an important notion for the verification of distributed systems. Timed bisimulation is its natural extension to real time systems. Timed bisimulation is known to be decidable for timed automata using the so-called region technique. We present a new, top down approach to timed bisimulation which applies the zone technique from the theory of hybrid systems. In contrast to the original decision algorithm, our method has a better space complexity and is scaling invariant: altering the time scale does not effect the space complexity.

关键词： algorithms and data structures automata and formal languages program specification and verification decidability real time systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：