TIMED CSP - THEORY AND PRACTICE

被引：0

作者：

DAVIES, J ^{[1
]}

JACKSON, DM ^{[1
]}

REED, GM ^{[1
]}

REED, JN ^{[1
]}

ROSCOE, AW ^{[1
]}

SCHNEIDER, SA ^{[1
]}

机构：

[1] UNIV OXFORD,COMP LAB,PROGRAMMING RES GRP,OXFORD OX1 3QD,ENGLAND

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1992年 / 600卷

关键词：

CONCURRENCY; REAL-TIME CSP; TEMPORAL LOGIC; TIMEWISE REFINEMENT; SPECIFICATION AND VERIFICATION; ROBOTICS; TELEPHONE SWITCHING; CONTROL SOFTWARE;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Over the past five years, G. M. Reed and A. W. Roscoe have directed a large group of research staff and graduate students at Oxford University in a comprehensive study of their theory of Timed CSP. This theory has now matured with associated proof systems, temporal logics, and refinement methods, and it has been employed in several realistic case studies. This paper presents an overview of the Oxford work on Timed CSP.

引用

页码：640 / 675

页数：36