UNDECIDABILITY RESULTS FOR DETERMINISTIC COMMUNICATING SEQUENTIAL PROCESSES

被引：8
|
作者：
CIESLAK, RA
VARAIYA, PP
机构：
[1] UNIV CALIF BERKELEY,DEPT ELECT ENGN & COMP SCI,BERKELEY,CA 94720
[2] UNIV CALIF BERKELEY,ELECTR RES LAB,BERKELEY,CA 94720
来源：
IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 1990年 / 35卷 / 09期
关键词：
D O I：
10.1109/9.58531
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We study the subset of the communicating sequential processes formalism in which processes are described in terms of recursive equations that use only constant processes, deterministic choice, parallel composition, and sequential composition. Even with this limited version, the formalism is powerful enough to model a Turing machine, so that a number of important problems such as boundedness, deadlock, and reachability are undecidable. © 1990 IEEE
引用
收藏
页码：1032 / 1039
页数：8
相关论文
共 50 条
12345