Polynomial-time analysis for a class of communicating processes

  • Scott A. Smolka
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 167)


"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.


Composition Operator Network Graph Reachable State Composition Strategy Biconnected Component 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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
  2. [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
  3. [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
  4. [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
  5. [Ho]
    C.A.R. Hoare, "Communicating Sequential Processes", Communications of the ACM, 21(8), pp. 666–677 (Aug. 1978).CrossRefGoogle Scholar
  6. [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
  7. [Mi]
    R. Milner, "A Calculus of Communicating Systems", Lecture Notes in Computer Science 92, Springer-Verlag (1980).Google Scholar
  8. [Sm]
    S.A. Smolka, "Analysis of Communicating Finite-State Processes", Department of Computer Science, Brown University, Ph.D. dissertation (Feb. 1984).Google Scholar
  9. [Ta]
    R.N. Taylor, "Complexity of Analyzing the Synchronization Structure of Concurrent Programs", Acta Informatica 19, pp. 57–84 (1983).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Scott A. Smolka
    • 1
  1. 1.Department of Computer ScienceState University of New YorkStony BrookU.S.A.

Personalised recommendations