Title :
Graph-based algorithms for parallel processes
Author :
Yordanova, Stefka
Author_Institution :
Dept. of Math. & Comput. Sci., South-West Univ. "Neofit Rilsky", Blagoevgrad, Bulgaria
Abstract :
The aim of this paper is to present some graph-based algorithms for Finite State Process (FSP). Communicating Sequential Process generated by Finite Transition System is called FSP. If P and Q are FSP, the parallel process P||Q also is FSP. We will present an algorithm to construct parallel process of finite set of FSP and an algorithm to construct finite complete prefix.
Keywords :
communicating sequential processes; concurrency theory; parallel algorithms; Communicating Sequential Process; Finite State Process; concurrency; finite transition system; graph-based algorithms; parallel process; Automata; Computer science; Concurrent computing; Mathematics;
Conference_Titel :
High Performance Computing Systems and Applications, 2002. Proceedings. 16th Annual International Symposium on
Print_ISBN :
0-7695-1626-2
DOI :
10.1109/HPCSA.2002.1019142
