C/E网系统中交叠式序列的计数

计算机科学 ›› 2010, Vol. 37 ›› Issue (11): 223-226.

C/E网系统中交叠式序列的计数

吴振寰,高莹,吴哲辉

(山东科技大学信息科学与工程学院青岛266510)

出版日期:2018-12-01 发布日期:2018-12-01
基金资助:
本文受国家自然科学基金(60673053,90718011)资助。

Counting Interlacing Sequence for C/E Systems

WU Zhen-huan,GAO Ying,WU Zhe-hui

Online:2018-12-01 Published:2018-12-01

摘要/Abstract

摘要： 在CCS中，Milner把系统中的两个事件处于并发定义为“它们可以按任意顺序发生”。这个关于并发的定义被称之为“交叠式并发”。然而在网论中，Petri把并发定义为“非序”，并指出并发是冲突的精确对偶。Petri关于并发的定义被公认为“真并发”。为了研究这两种并发概念的联系和差异，以C/E系统为模型，分别从这两种不同定义的视角出发，讨论了并发的表现和实质，并对网系统中存在的不同并发组合情况给出了求交叠式序列(根据交叠式并发概念而得出)个数的一组计算公式。

关键词: 并发，真并发，交叠式并发，C/E系统，交叠式序列

Abstract: That a pair of events in a system is said to be in concurrency is defined as "they can occur in any order" by R. Milner in CCS (Calculus of Communication System). This definition about concurrency is named as "interlacing concurrency". However, concurrency is defined as "disorder" by C. A. Petri in net theory. It is recognized as "true concurrency". In order to investigate the relationship and the difference between these two concepts, we used C/E system as models to discuss the appearance and essentiality of concurrency under both of these two definitions. As a result, a set of formulas to count the number of interlacing sequence (under the concept of interlacing concurrency) upon variable situations were given.

Key words: Concurrency, True concurrency, Interlacing concurrency, C/E system, Interlacing sequence

吴振寰,高莹,吴哲辉. C/E网系统中交叠式序列的计数[J]. 计算机科学, 2010, 37(11): 223-226. https://doi.org/

WU Zhen-huan,GAO Ying,WU Zhe-hui. Counting Interlacing Sequence for C/E Systems[J]. Computer Science, 2010, 37(11): 223-226. https://doi.org/

参考文献

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed