Skip to main content
SpringerLink
Log in

On the computational power of operators in ICSP with fairness

  • Concurrency
  • Conference paper
  • First Online:
Foundation of Software Technology and Theoretical Computer Science (FSTTCS 1994)

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

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. J D Brock and W B Ackermann, Scenerios: A Model of Nondeterministic Computation, Formalization of Programming Concepts, Lect. Notes in Comp. Science 107, Springer, 1981

    Google Scholar 

  2. M.B.Josephs, Receptive Process Theory, Acta Informatica 29, February 1992.

    Google Scholar 

  3. M.B.Josephs, C.A.R.Hoare and He Jifeng, A Theory of Asynchronous Processes, PRG-TR-6-89, Programming Research Group, Oxford University, 1989.

    Google Scholar 

  4. Bengt Jonsson, A Fully Abstract Trace Model for Dataflow Networks, POPL, 1989.

    Google Scholar 

  5. K Narayan Kumar and Paritosh K Pandya, ICSP and its Relationship with CSP and ACSP, FSTTCS, Lect. Notes in Comp. Science 761, Springer-Verlag, 1993.

    Google Scholar 

  6. K Narayan Kumar and Paritosh K Pandya, On the Computational Power of ICSP with Fairness, Technical Report, Tata Institute of Fundamental Research, 1994.

    Google Scholar 

  7. A W Roscoe and C A R Hoare, The Laws of Occam Programming, Theor. Comp. Sci. 60, 1988.

    Google Scholar 

  8. A W Roscoe, Two Papers on CSP, PRG-TR-67-88, Programming Research Group, Oxford University, 1988.

    Google Scholar 

  9. Paritosh K Pandya and C A R Hoare, JSD in Asynchronous CSP, Technical Note, Programming Research Group, Oxford University, 1988.

    Google Scholar 

  10. Prakash Panangaden and Eugene Stark, Computations, Residuals and the Power of Indeterminacy, Lect. Notes in Comp. Science 317, Springer-Verlag, 1988.

    Google Scholar 

  11. Eugene Stark, Compositional Relational Semantics of Indeterminate Dataflow Networks, Lect. Notes in Comp. Science 389, Springer-Verlag, 1989.

    Google Scholar 

  12. Eugene Stark, On the Relations Computed by a Class of Automata, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Group, TIFR, Bombay, India

    K Narayan Kumar & Paritosh K Pandya

Authors
  1. K Narayan Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paritosh K Pandya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. S. Thiagarajan

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kumar, K.N., Pandya, P.K. (1994). On the computational power of operators in ICSP with fairness. In: Thiagarajan, P.S. (eds) Foundation of Software Technology and Theoretical Computer Science. FSTTCS 1994. Lecture Notes in Computer Science, vol 880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58715-2_128

Download citation

  • DOI: https://doi.org/10.1007/3-540-58715-2_128

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58715-6

  • Online ISBN: 978-3-540-49054-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation