Polynomial-time analysis for a class of communicating processes
"Can a process terminate prematurely?" is a computationally difficult question to answer for finite-state communicating processes. We present an algorithm for this problem that runs in polynomial (quadratic) time for a significant class of communicating processes. The underlying model is algebraic and represents a restriction of Milner's CCS to finite-state systems with one-to-one communication.
In order to answer the question of premature termination for process P i , we express the problem as a two-player game, P i versus the rest of the network. We then show that this problem can be restated in terms of the network's [HBR] failure. This leads to an algorithm based on an efficient procedure for computing the failures of a network. An on-board comparator and a rebound sorter are used as illustrative examples.
KeywordsComposition Operator Network Graph Reachable State Composition Strategy Biconnected Component
Unable to display preview. Download preview PDF.
- [Br1]S.D. Brookes, "On the Relationship of CCS and CSP", Proceedings of the 10th ICALP, Barcelona, Spain, pp. 85–96 (July 1983).Google Scholar
- [Br2]S.D. Brookes, "A Model for Communicating Sequential Processes", Department of Computer Science, Carnegie-Mellon University, Technical Report No. CMU-CS-83-149 (Jan. 1983).Google Scholar
- [DS]T.W. Doeppner, S.A. Smolka, "An Algorithm for the Static Analysis of CSP Programs", Department of Computer Science, Brown University, Technical Report (1981).Google Scholar
- [Go]M.G. Gouda, "Systems of Communicating Machines Without Deadlocks", Department of Computer Sciences, University of Texas at Austin, Austin, TX, Technical Report No. TR-199 (April 1982).Google Scholar
- [HBR]C.A.R. Hoare, S.D. Brookes, A.W. Roscoe, "A Theory of Communicating Sequential Processes", Technical Monograph PRG-16, Oxford University Computing Laboratory, Programming Research Group (May 1981).Google Scholar
- [Mi]R. Milner, "A Calculus of Communicating Systems", Lecture Notes in Computer Science 92, Springer-Verlag (1980).Google Scholar
- [Sm]S.A. Smolka, "Analysis of Communicating Finite-State Processes", Department of Computer Science, Brown University, Ph.D. dissertation (Feb. 1984).Google Scholar
- [Ta]R.N. Taylor, "Complexity of Analyzing the Synchronization Structure of Concurrent Programs", Acta Informatica 19, pp. 57–84 (1983).Google Scholar