Hoang Chi Thanh

Main Article Content

Abstract

Abstract: In this paper we investigatc and build up three methods for transíorming sequential
processes of a net system into concurrent oncs. These mcthods are based on: trace languages, shift-
lcft and case graphs. They arc also prescnlcd by detail algonthms and can be applicd to other
modcls of concurrcnt systems.
Keywords: net system, reliance alphabet, trace language, maximal concurrent steps, case graph.

References

J.l. Aalbcrsbcg, G. Ro/cnbcrg, Theory o f Traccs, Theoreticaỉ Computer Science 6 0 (1988) 1.
[2] A. Mazurkicwicz, Concurrcnt program schcmes and thcir intcrprctations, DAIMỊ Report PB-78, Aarhus Univ.,
Denmark, 1977.
[3] Hoang Chi Thanh, Behavioural Synchronization o f Nct Systems, ĨMSc Report / / 5 , Madras, India (1991) 136.
[4] Hoang Chi Thanh, Algorithms Transíorming Sequcntial Proccsscs into Concurrcnt Ones, Proceedings o f the
Second National Symposium "Fundamentaỉ and Applied hìformation Technology Research (FA!R), Science &
Techniquc Press, 2006.
[5] w. Reisig, Petri Nets: An Introduction, Springcr-Vcrlag, 1985.
[6] Hoang Chi Thanh, Vu Trong Quc, Using casc graphs in concurrency control on nct systcms Proceedings o f the y h
National Symposium on Ịnformaíion Technology and Communicatiotì, 2006.