Approximate trace and singleton failures equivalences for event structures

被引：0

作者：

Li S.-R. ^{[1
]}

Wang C. ^{[2
]}

机构：

[1] School of Optoelectronic Information, University of Electronic Science and Technology of China, Chengdu

[2] The 6th Research Institute of China Electronics Corporation, Haidian, Beijing

来源：

Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China | 2016年 / 45卷 / 04期

关键词：

Approximate equivalence; Event structures; Singleton failures; Step; Trace;

D O I：

10.3969/j.issn.1001-0548.2016.04.020

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Establishing system equivalences for event structures such as trace and testing equivalences, require the observed actions to be exactly identical. However, an accurate measurement is impossible when interacting with the physical world, hence exact equivalence is restrictive and not robust. Using Baire metric, this paper proposes a generalized framework of event structures approximation by developing the notions of approximate interleaving (trace and singleton failures) equivalence and approximate step (trace and singleton failures) equivalence. The proposed framework captures the traditional exact equivalence as a special case. These approximate equivalences satisfy the transitive property, consequently, they can be successively used in event structures approximations. © 2016, Editorial Board of Journal of the University of Electronic Science and Technology of China. All right reserved.

引用

页码：674 / 683

页数：9

共 22 条

[1] Nielsen M., Plotkin G., Winskel G., Petri nets, event structures and domains, Semantics of Concurrent Computation, 70, pp. 266-284, (1979)
[2] Baldan P., Crafa S., A logic for true concurrency, CONCUR 2010-Concurrency Theory, pp. 147-161, (2010)
[3] Gutierrez J., Winskel G., On the determinacy of concurrent games on event structures with infinite winning sets, Journal of Computer and System Sciences, 80, 6, pp. 1119-1137, (2014)
[4] Czaja I., Van Glabbeek R.J., Goltz U., Interleaving semantics and action refinement with atomic choice, Advances in Petri Nets 1992, pp. 89-107, (1992)
[5] Andreeva M.V., Virbitskaite I.B., Timed equivalences for timed event structures, maParallel Computing Technologies, pp. 16-26, (2005)
[6] Aceto L., De Nicola R., Fantechi A., Testing equivalences for event structures, Mathematical models for the semantics of parallelism, 280, pp. 1-20, (1987)
[7] Taubner D., Voglerw, Step failures semantics and a complete proof system, Acta Informatica, 27, 2, pp. 125-156, (1989)
[8] Van Glabbeek R.J., The linear time-branching time spectrum i-the semantics of concrete, sequential processes, Handbook of Process Algebra, pp. 3-99, (2001)
[9] Ying M., Bisimulation indexes and their applications, Theoretical Computer Science, 275, 1, pp. 1-68, (2002)
[10] Wang C., Wu J.-Z., Tan H.-Y., Approximate trace and singleton failures equivalences for transition systems, Journal of Systems Engineering and Electronics, 26, 4, pp. 886-896, (2015)

← 1 2 3 →