BUNDLE EVENT STRUCTURES - A NON-INTERLEAVING SEMANTICS FOR LOTOS

被引:0
作者
LANGERAK, R [1 ]
机构
[1] UNIV TWENTE, DEPT COMP SCI, 7500 AE ENSCHEDE, NETHERLANDS
来源
IFIP TRANSACTIONS C-COMMUNICATION SYSTEMS | 1993年 / 10卷
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We argue that prime, stable, and flow event structures axe not very practical for providing a semantics for LOTOS as they all have some drawbacks. That is why we introduce bundle event structures as labelled event structures with a binary conflict relation and a so-called bundle set instead of a causality, precedence or flow relation. Bundle event structures have an attractive graphical representation; the analysis is facilitated by providing several equivalence laws. Like in flow and stable event structures, events can be enabled in different ways. There are no self-conflicting events like in flow event structures. We do allow so-called impossible events that can never happen but can always be removed (unlike self-conflicting events in flow event structures). A bundle event structure semantics is given for a Basic LOTOS subset containing all operators except disabling and process instantiation. This semantics is proven correct with respect to a simple event transition system.
引用
收藏
页码:331 / 346
页数:16
相关论文
共 24 条
[1]   INTRODUCTION TO THE ISO SPECIFICATION LANGUAGE LOTOS [J].
BOLOGNESI, T ;
BRINKSMA, E .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1987, 14 (01) :25-59
[2]  
BOTMA B, 1992, PROTOCOL SIMULATION
[3]   CONCURRENCY AND ATOMICITY [J].
BOUDOL, G ;
CASTELLANI, I .
THEORETICAL COMPUTER SCIENCE, 1988, 59 (1-2) :25-84
[4]   PERMUTATION OF TRANSITIONS - AN EVENT STRUCTURE SEMANTICS FOR CCS AND SCCS [J].
BOUDOL, G ;
CASTELLANI, I .
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 354 :411-427
[5]  
BOUDOL G, 1991, INRIA1482 RES REP
[6]  
BOUDOL G, 1991, INRIA1484 RES REP
[7]  
BRINKSMA E, 1989, LNCS, V430, P130
[8]  
Castellani I., 1988, THESIS U EDINBURGH
[9]  
DENICOLA R, 1984, TH COMP SCI, V34, P183
[10]  
Hoare C. A. R., 1985, COMMUNICATING SEQUEN