ON THE ANALYSIS OF COOPERATION AND ANTAGONISM IN NETWORKS OF COMMUNICATING PROCESSES.

被引:0
|
作者
Kanellakis, Paris C. [1 ]
Smolka, Scott A. [1 ]
机构
[1] Brown Univ, Providence, RI, USA, Brown Univ, Providence, RI, USA
来源
Algorithmica (New York) | 1988年 / 3卷 / 03期
关键词
COMPUTATIONAL COMPLEXITY - CONCURRENT PROGRAMMING - FINITE STATE PROCESS - NP-COMPLETE - PSPACE-COMPLETE;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:421 / 450
相关论文
共 50 条