Advertisement

On the computational power of operators in ICSP with fairness

  • K Narayan Kumar
  • Paritosh K Pandya
Concurrency
Part of the Lecture Notes in Computer Science book series (LNCS, volume 880)

Keywords

Expressive Power Infinite Sequence Output Event Output Channel Complete Computation 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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, 1981Google Scholar
  2. 2.
    M.B.Josephs, Receptive Process Theory, Acta Informatica 29, February 1992.Google Scholar
  3. 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. 4.
    Bengt Jonsson, A Fully Abstract Trace Model for Dataflow Networks, POPL, 1989.Google Scholar
  5. 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. 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. 7.
    A W Roscoe and C A R Hoare, The Laws of Occam Programming, Theor. Comp. Sci. 60, 1988.Google Scholar
  8. 8.
    A W Roscoe, Two Papers on CSP, PRG-TR-67-88, Programming Research Group, Oxford University, 1988.Google Scholar
  9. 9.
    Paritosh K Pandya and C A R Hoare, JSD in Asynchronous CSP, Technical Note, Programming Research Group, Oxford University, 1988.Google Scholar
  10. 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. 11.
    Eugene Stark, Compositional Relational Semantics of Indeterminate Dataflow Networks, Lect. Notes in Comp. Science 389, Springer-Verlag, 1989.Google Scholar
  12. 12.
    Eugene Stark, On the Relations Computed by a Class of Automata, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • K Narayan Kumar
    • 1
  • Paritosh K Pandya
    • 1
  1. 1.Computer Science GroupTIFRBombayIndia

Personalised recommendations