Transforming sequential processes of net systems into concurrent ones

Authors:
Hoang Chi Thanh
Affiliations:
Hanoi University of Science, Department of Informatics, 334 - Nguyen Trai str., Hanoi, Vietnam. E-mail: thanhhc@vnu.edu.vn
Venue:
International Journal of Knowledge-based and Intelligent Engineering Systems
Year:
2007

Citing 4
Cited 3

Petri nets: an introduction

Petri nets: an introduction
Theory of traces

Theoretical Computer Science
Semi-commutations and Petri nets

Theoretical Computer Science
On the Relation Between Firing Sequences and Processes of Petri Nets

FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory

Semi-traces and Their Application in Concurrency Control Problem

ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
A parallel dimensionality reduction for time-series data and some of its applications

International Journal of Intelligent Information and Database Systems
Parallelizing a new algorithm for the set partition problem

Annales UMCS, Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

Translating sequential programs into concurrent ones to increase the time performance by making excessive use of the available recourses (processors) in the system is an important part of the compiler of concurrent programming languages. We present three algorithms for transforming sequential processes of a net system into concurrent ones. The first two are applied to programs with bounded behaviour, and the last is applied to the systems for which the maximal parallel semantics is the same as the parallel semantics. These algorithms are based on: trace languages, shift-left and case graphs. Though they are only presented for net systems, they can be adapted for different models of concurrent systems as well.