文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Observational logic
侵权投诉

Observational logic

Abstract. We present an institution of observational logic suited for state-based systems specifications. The institution is based on the notion of an observational signature (which incorporates the declaration of a distinguished set of observers) and on o

Observational Logic

Rolf Hennicker*, Michel Bidoit**

*Institut für Informatik, Ludwig-Maximilians-Universität München

Oettingenstr. 67, D-80538 München, GERMANY

**Laboratoire Spécification et Vérification, CNRS & Ecole Normale Supérieure de Cachan

61, Avenue du Président Wilson, 94235 Cachan Cedex, FRANCE

Abstract. We present an institution of observational logic suited for state-based

systems specifications. The institution is based on the notion of an observational

signature (which incorporates the declaration of a distinguished set of observers)

and on observational algebras whose operations are required to be compatible

with the indistinguishability relation determined by the given observers. In

particular, we introduce a homomorphism concept for observational algebras

which adequately expresses observational relationships between algebras. Then

we consider a flexible notion of observational signature morphism which

guarantees the satisfaction condition of institutions w.r.t. observational

satisfaction of arbitrary first-order sentences. From the proof theoretical point of

view we construct a sound and complete proof system for the observational

consequence relation. Then we consider structured observational specifications

and we provide a sound and complete proof system for such specifications by

using a general, institution-independent result of [6].

1Introduction

In this paper we study a logical framework for the specification of the observablebehaviour of software systems which is particularly suited for state-based systems butmay also be used for specifying infinite data and behavioural properties of abstractdata types. Formally, we introduce an institution of observational logic and we studyproof methods for first-order observational properties of structured specifications builtover this institution.

Although our approach is novel, it is influenced by previous behavioural approaches,in particular of [4, 11, 16, 21, 23]. The important difference to [4] is that in the presentapproach we use a built-in observational semantics which previously led to problemsw.r.t. the encapsulation of observational properties of parts of a system specification(cf. [1, 15]). In the hidden sorted algebra approach (cf. e.g. [11]) encapsulation isachieved at the cost of a rather restrictive notion of signature morphism whichrecently was generalized in [8] (see the discussion in Section 5). Another popularformalism which deals with a state-based view of systems is provided in theframework of coalgebras (cf. e.g. [23, 16]). These approaches, however, haveproblems to deal with n-ary operations working on several non-observable (hidden)argument sorts which frequently occur in practice (see also Section 5). Moreover,coalgebraic approaches are based on terminal semantics while we are interested in aloose semantics in order to obtain sufficient freedom for the choice ofimplementations.

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email