Graph-based algorithms for parallel processes
Published • Jun 25, 2003
NobleIDNI9P54W98R46S06
Authors:
S. Yordanova
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/spl par/Q also is FSP. We will present an algorithm to construct parallel p...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!