Skip to Main Content
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.
Date of Conference: 2002