A temporal logic for reasoning about timed concurrent constraint programs

被引：10

作者：

de Boer, FS ^{[1
]}

Gabbrielli, M ^{[1
]}

Meo, MC ^{[1
]}

机构：

[1] Univ Utrecht, NL-3508 TC Utrecht, Netherlands

来源：

EIGHTH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING, PROCEEDINGS | 2001年

关键词：

D O I：

10.1109/TIME.2001.930721

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A temporal logic is presented for reasoning about the correctness of timed concurrent constraint programs. ne logic is based on epistemic modalities which express either what a process knows at a certain time or what a process believes about the results of the other processes. In terms of these epistemic modalities of " knowledge " and " belief " a compositional axiomatization is given of the reactive behaviour of timed concurrent constraint programs.

引用

页码：227 / 233

页数：7

共 16 条

[1]

Baeten J. C. M., 1991, Formal Aspects of Computing, V3, P142, DOI 10.1007/BF01898401

[2] THE ESTEREL SYNCHRONOUS PROGRAMMING LANGUAGE - DESIGN, SEMANTICS, IMPLEMENTATION [J].

BERRY, G ;

GONTHIER, G .

SCIENCE OF COMPUTER PROGRAMMING, 1992, 19 (02) :87-152

[3]

BROOKES S, 1993, P 8 IEEE S LOG COMP

[4]

DEBOER FS, 1991, LECT NOTES COMPUT SC, V527, P111

[5]

DEBOER FS, 1991, LECT NOTES COMPUT SC, V493, P296

[6] Proving concurrent constraint programs correct [J].

DeBoer, FS ;

Gabbrielli, M ;

Marchiori, E ;

Palamidessi, C .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1997, 19 (05) :685-725

[7]

DEBOER FS, 2000, INFORMATION COMPUTAT, P161

[8]

FALASCHI M, 2000, P AGP 2000

[9] An introduction to executable temporal logics [J].

Fisher, M .

KNOWLEDGE ENGINEERING REVIEW, 1996, 11 (01) :43-56

[10] A PROCESS ALGEBRA FOR TIMED SYSTEMS [J].

HENNESSY, M ;

REGAN, T .

INFORMATION AND COMPUTATION, 1995, 117 (02) :221-239

← 1 2 →