Skip to main content
Log in

On the analysis of cooperation and antagonism in networks of communicating processes

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We propose a new method for the analysis of cooperative and antagonistic properties of communicating finite state processes (FSPs). This algebraic technique is based on a composition operator and on the notion of possibility equivalence among FSPs. We demonstrate its utility by showing that potential blocking, termination, and lockout can be decided in polynomial time for loosely connected networks of tree FSPs. Potential blocking and termination are examples of cooperative properties, while lockout is an antagonistic one. For loosely connected networks of (the more general) acyclic FSPs, the cooperative properties become NP-complete and the antagonistic ones PSPACE-complete. For tightly coupled networks of tree FSPs, we also have NP-completeness for the cooperative properties. For the harder case of FSPs with cycles, we provide a natural extension of the method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA (1974).

    MATH  Google Scholar 

  2. S. D. Brookes, On the Relationship of CCS and CSP,Proceedings of the 10th ICALP, Barcelona, pp. 83–96 (July 1983).

  3. S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe, A Theory of Communicating Sequential Processes,Journal of the Association for Computing Machinery, Vol. 31, No. 3, pp. 560–599 (1984).

    MATH  MathSciNet  Google Scholar 

  4. D. Brand and P. Zafiropoulo, On Communicating Finite-State Machines,Journal of the Association for Computing Machinery, Vol. 30, No. 2, pp. 323–342 (1983).

    MATH  MathSciNet  Google Scholar 

  5. E. M. Clarke, E. A. Emerson, and A. P. Sistla, Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach,Proceedings of the 10th ACM Symposium on Principles of Programming Languages, Austin, TX (April 1983).

  6. M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979).

    MATH  Google Scholar 

  7. G. J. Holtzmann, A Theory for Protocol Validation,IEEE Transactions on Computers, Vol. 31, No. 8, pp. 730–738 (1982).

    Article  Google Scholar 

  8. P. C. Kanellakis and S. A. Smolka, CCS Expressions, Finite State Processes, and Three Problems of Equivalence,Proceedings of 2nd ACM Symposium on the Principles of Distributed Computing, Montreal, pp. 228–240 (August 1983).

  9. R. Ladner, The Complexity of Problems in Systems of Communicating Sequential Processes,Journal of Computer and Systems Sciences, Vol. 21, No. 2, pp. 179–194 (1980).

    Article  MATH  MathSciNet  Google Scholar 

  10. H. W. Lenstra, Jr., Integer Programming with a Fixed Number of Variables, Mathematics Department Report 81-03, University of Amsterdam (1981).

  11. R. Milner,A Calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 92, Springer-Verlag, Berlin (1980).

    Google Scholar 

  12. S. S. Owicki and L. Lamport, Proving Liveness Properties of Concurrent Programs,ACM Transactions on Programming Languages and Systems, Vol. 4, No. 3, pp. 455–495 (1982).

    Article  MATH  Google Scholar 

  13. J. H. Reif, Universal Games of Incomplete Information,Proceedings of the 11th ACM Symposium on Theory of Computing, pp. 288–308 (1979).

  14. T. Räuchle and S. Toueg, Exposure to Deadlock for Communicating Processes is Hard to Detect, Technical Report No. TR 83-555, Department of Computer Science, Cornell University, Ithaca, NY (May 1983).

    Google Scholar 

  15. S. A. Smolka, Analysis of Communicating Finite-State Processes, Technical Report No. CS-84-05, Department of Computer Science, Brown University, Providence, RI (February 1984).

    Google Scholar 

  16. R. N. Taylor, Complexity of Analyzing the Synchronization Struture of Concurrent Programs,Acta Informatica, Vol. 19, pp. 57–84 (1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by Jeffrey Scott Vitter.

A preliminary version of this paper appeared as an extended abstract in theProceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, August, 1985, pp. 23–38. P. C. Kanellakis was supported by ONR-DARPA Grant N00014-83-K-0146, NSF Grant DCR-8302391, and by the Office of Army Research under contract DAAG29-84-K-0058. S. A. Smolka was supported by National Science Foundation Grant DCR-8505873.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kanellakis, P.C., Smolka, S.A. On the analysis of cooperation and antagonism in networks of communicating processes. Algorithmica 3, 421–450 (1988). https://doi.org/10.1007/BF01762125

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01762125

Key words

Navigation