Skip to main content
Springer Nature Link
Log in

The expressive power of delay operators in SCCS

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We investigate the relative expressive power of finite delay operators in SCCS. These were introduced by Milner and by Hennessy to study fairness properties of processes in the context of SCCS. We show that the context sensitive delay operator introduced by Hennessy is more expressive than the finite delay operator introduced by Milner. This result is closely related to recent results by Pananagden and Stark on the expressive power of fair merge in asynchronous dataflow (Kahn) networks. It indicates that the expressiveness results obtained there are not sensitive to the precise computational model since SCCS, unlike Kahn networks, is synchronous and permits expansion of recursively defined processes.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Hennessy, M.: Axiomatizing finite delay operators. Acta Inf.21, 61–88 (1984)

    Google Scholar 

  2. Hennessy, M.: Algebraic theory of processes. Cambridge London: MIT Press 1988

    Google Scholar 

  3. Milner, R.: A finite-delay operator in synchronous ccs. Technical report CSR-116-82, University of Edinburgh, 1982

  4. Milner, R.: Calculi for synchrony and asynchrony. Theor. Comput. Sci.25, 267–310 (1983)

    Google Scholar 

  5. Milner, R.: Communication and concurrency. Englewood Cliffs, NJ: Prentice-Hall 1989

    Google Scholar 

  6. Panangaden, P., Stark, E.W.: Computations, residuals and the power of indeterminacy. In: Lepisto, T., Salomaa, A. (eds.) Proceedings of the Fifteenth ICALP. (Lect. Notes Comput. Sci., vol. 317, pp. 439–454) Berlin Heidelberg New York: Springer 1988

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Applied Mathematics, Cornell University, 312 Sage Hall, 14853-7501, Ithaca, NY, USA

    Carol Critchlow

  2. Computer Science Department, Cornell University, 4130 Upson Hall, 14853-7501, Ithaca, NY, USA

    Prakash Panangaden

Authors
  1. Carol Critchlow
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prakash Panangaden
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by NSF grant CCR-8818979. Present address: School of Computer Science, 3480 Rue University, McGill University, Montreal, Quebec, Canada H3A 2A7

Rights and permissions

Reprints and permissions

About this article

Cite this article

Critchlow, C., Panangaden, P. The expressive power of delay operators in SCCS. Acta Informatica 28, 447–452 (1991). https://doi.org/10.1007/BF01178582

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation