Skip to main content
SpringerLink
Log in

Descriptional complexity of concurrent processes (preliminary version)

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1980 (MFCS 1980)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 88))

  • 128 Accesses

Abstract

This paper compares several algebraic software description techniques which were proposed recently. Using language theoretic tools we show that some of the most handy concurrent behavior descriptors (inverse shuffle and cancellation) when combined with the operations of shuffle, shuffle iteration and the regular operations yield the full power of Turing Machines. Specifically, the flow expressions of Shaw and Kimura's D-and E-expressions are all universal in this sense.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Hopcroft, J.E. and Ullman, J.D. — The Design and Analysis of Computer Algorithms; Addison-Wesley, 1974.

    Google Scholar 

  2. Campbell, R., Habermann, A.N. — The Specification of Process Synchronization by Path Expressions; Springer Verlag, LNCS 16, 1974, pp. 89–102.

    Google Scholar 

  3. Dijkstra, E.W. — Cooperating Sequential Processes; Programming Languages (ed. F. Genuys), Academic Press.

    Google Scholar 

  4. Feldman, J.A. — A Programming Methodology for Distributed Computing (among other things); TR-9, Dept. of CS, Univ. of Rochester, 1976.

    Google Scholar 

  5. Ginsburg, S. — The Mathematical Theory of Context-free Languages; McGraw-Hill, 1966.

    Google Scholar 

  6. Ginsburg, S. and Spanier, E.H. — Mappings of Languages by Two-Tape Devices; JACM 12,3 (1965), pp. 423–434.

    Google Scholar 

  7. Greif, I. — A Language for Formal Problem Specification; CACM 20, 12 (1977), pp. 931–935.

    Google Scholar 

  8. Haberman, A.N. — Path Expressions; CS Dept., Carnegie-Mellon, June 1975.

    Google Scholar 

  9. Hoare, C.A.R. — Communicating Sequential Processes; CACM 21, 8 (1978), pp. 666–677.

    Google Scholar 

  10. Hopcroft, J.E. and Ullman, J.D. — Formal Languages and their Relation to Automata; Addison-Wesley, 1969.

    Google Scholar 

  11. Höpner, M. and Opp, M. — About three Equational Classes of Languages built by shuffle Operations; Springer Verlag, LNCS 45, 1976, pp. 337–344.

    Google Scholar 

  12. Hunt, H.B. III — On Time and Tape Complexity of Languages; Ph.D. Dissertation, Cornell Univ., 1973.

    Google Scholar 

  13. Jantzen, M. — private communication.

    Google Scholar 

  14. Kimura, T. — An Algebraic System for Process Structuring and Interprocess Communication; 8th ACM STOC, Hershey, Penn., 1976, pp. 92–100.

    Google Scholar 

  15. Kimura, T. — Formal Description of Communication Behaviour; John Hopkins Conference on Information Sciences and Systems, Baltimore 1979.

    Google Scholar 

  16. Kimura, T. — Algebraic Study of Concurrent System Behaviour; Working Note #43, Dept. of CS, Washington Univ., 1979.

    Google Scholar 

  17. Ladner, R.E. — The Complexity of Problems in Systems of Communicating Sequential Processes; 11th ACM STOC, Atlanta, Georgia, 1979, pp. 214–223.

    Google Scholar 

  18. Lipton, R.J. — The Reachability Problem Requires Exponential Space; Yale Research Report #6, 1976.

    Google Scholar 

  19. Mazurkiewicz, A. — Parallel Recursive Program Schemes; 4th Symposium MFCS, Springer Verlag, LNCS 32, 1975, pp. 75–87.

    Google Scholar 

  20. Meyer, A.R. and Stockmeyer, L.J. — The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space; 13th SWAT, 1972, pp. 125–129.

    Google Scholar 

  21. Ogden, W.F., Riddle, W.E. and Rounds, W.C. — Complexity of Expressions Allowing Concurrency; 5th ACM POPL, Tucson, Arizona, 1978, pp. 185–194.

    Google Scholar 

  22. Reif, J.H. — Analysis of Communicating Processes; TR-30, Dept. of CS, Univ. of Rochester, 1978.

    Google Scholar 

  23. Riddle, W.E. — Modelling and Analysis of Supervisory Systems; Ph.D. Dissertation, Stanford Univ., March 1972.

    Google Scholar 

  24. Riddle, W.E. — An Approach to Software System Modelling, Behavior, Specification and Analysis; RSSM/25, Dept. of CCS, Univ. of Michigan, July, 1976.

    Google Scholar 

  25. Shaw, A.C. — Software Descriptions with Flow Expressions; IEEE Trans. on SE, 3, 1978, pp. 242–254.

    Google Scholar 

  26. Slutzki, G. — Non-Synchronizing Concurrent Processes and their Languages; Dept. of CIS, Univ. of Delaware, April, 1979.

    Google Scholar 

  27. Stockmeyer, L.J. — The Complexity of Decision Problems in Automata Theory and Logic; Project MAC, TR-133, MIT, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Clarkson College of Technology, 13676, Potsdam, New York, USA

    Giora Slutzki

Authors
  1. Giora Slutzki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Dembiński

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Slutzki, G. (1980). Descriptional complexity of concurrent processes (preliminary version). In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022536

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10027-0

  • Online ISBN: 978-3-540-38194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation