PREDICATE TRANSFORMERS IN THE CONTEXT OF SYMBOLIC MODELING OF TRANSITION SYSTEMS

被引：0
|
作者：
Godlevsky, A. B. [1 ]
机构：
[1] Natl Acad Sci Ukraine, Cybernet Inst, Kiev, Ukraine
来源：
CYBERNETICS AND SYSTEMS ANALYSIS | 2010年 / 46卷 / 04期
关键词：
attribute transition systems; symbolic modeling; predicate transformer; basic protocol;
D O I：
10.1007/s10559-010-9236-8
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In modelling attribute transition systems, classes of their states can be described in a given signature of functional and predicate symbols. A procedure is developed for transforming such formulas by assignment operators and the obtained formulas are proved to correspond to strongest postconditions. A peculiarity of this paper is that functional-type attributes can be used in specifying transition systems, in particular, their array-type attributes.
引用
收藏
页码：602 / 608
页数：7
相关论文
共 50 条
12345