Skip to main content
Book cover

Communicating Sequential Processes. The First 25 Years pp 85–97Cite as

Models for Data-Flow Sequential Processes

  • Chapter

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 3525)

Abstract

A family of mathematical models of nondeterministic data flow is introduced. These models are constructed out of sets of traces, successes, failures and divergences, cf. Hoare’s traces model, Roscoe’s stable-failures model and Brookes and Roscoe’s failures/divergences model of Communicating Sequential Processes. As in CSP, operators are defined that are convenient for constructing processes in the various models.

Keywords

  • Complete Lattice
  • Parallel Composition
  • Input Stream
  • Input Symbol
  • Output Stream

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.

This is a preview of subscription content, access via your institution.

Chapter
GBP   19.95
Price includes VAT (United Kingdom)
  • DOI: 10.1007/11423348_6
  • Chapter length: 13 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
GBP   47.99
Price includes VAT (United Kingdom)
  • ISBN: 978-3-540-32265-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
GBP   59.99
Price includes VAT (United Kingdom)
Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brock, J.D., Ackerman, W.B.: Scenarios: A Model of Non-Determinate Computation. In: Díaz, J., Ramos, I. (eds.) Formalization of Programming Concepts. LNCS, vol. 107, pp. 252–259. Springer, Heidelberg (1981)

    Google Scholar 

  2. Brookes, S.D.: On the Kahn Principle and Fair Networks. Technical Report CMU-CS-98-156, School of Computer Science, Carnegie Mellon University, Pittsburg, USA (1998)

    Google Scholar 

  3. Brookes, S.D.: Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 466–482. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  4. Brookes, S.D., Roscoe, A.W.: An improved failures model for CSP. In: Brookes, S.D., Winskel, G., Roscoe, A.W. (eds.) Seminar on Concurrency. LNCS, vol. 197, pp. 281–305. Springer, Heidelberg (1985)

    Google Scholar 

  5. Broy, M.: A Theory for Nondeterminism, Parallelism, Communication, and Concurrency. Theoretical Computer Science 45, 1–61 (1986)

    MATH  CrossRef  MathSciNet  Google Scholar 

  6. Broy, M., Lengauer, C.: On Denotational versus Predicative Semantics. Journal of Computer and System Sciences 42(1), 1–29 (1991)

    MATH  CrossRef  MathSciNet  Google Scholar 

  7. Chandy, K.M., Misra, J.: Reasoning about networks of communicating processes. In: Presented at INRIA Advanced NATO Study Institute on Logics and Models for Verification and Specification of Concurrent Systems, La Colle-sur-Loupe, France (1984) (Unpublished)

    Google Scholar 

  8. Gischer, J.L.: The Equational Theory of Pomsets. Theoretical Computer Science 62, 299–224 (1988)

    Google Scholar 

  9. Jifeng, H., Josephs, M.B., Hoare, C.A.R.: A Theory of Synchrony and Asynchrony. In: Broy, M., Jones, C.B. (eds.) Programming Concepts and Methods, pp. 459–478. Elsevier Science Publishers, North-Holland (1990)

    Google Scholar 

  10. Hehner, E.C.R.: Predicative Programming Part II. Communications of the ACM 27(2), 144–151 (1984)

    MATH  CrossRef  MathSciNet  Google Scholar 

  11. Hoare, C.A.R.: A model for communicating sequential processes. In: McKeag, R.M., MacNaughten, A.M. (eds.) On the construction of programs, pp. 229–254. Cambridge University Press, Cambridge (1980)

    Google Scholar 

  12. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  13. Hoare, C.A.R., Jifeng, H.: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  14. Jonsson, B.: A model and proof system for asynchronous networks. In: Proc. 4th Annual ACM Symp. on Principles of Distributed Computing, pp. 49–58 (1985)

    Google Scholar 

  15. Josephs, M.B.: Receptive process theory. Acta Informatica 29, 17–31 (1992)

    MATH  CrossRef  MathSciNet  Google Scholar 

  16. Josephs, M.B., Hoare, C.A.R., Jifeng, H.: A theory of asynchronous processes. Technical Report PRG-TR-6-89, Oxford University Computing Laboratory, Oxford, England (1989)

    Google Scholar 

  17. Kahn, G.: The semantics of a simple language for parallel programming. In: Rosenfeld, J.L. (ed.) Information Processing 1974, pp. 471–475. North-Holland, Amsterdam (1974)

    Google Scholar 

  18. Kahn, G., MacQueen, D.B.: Coroutines and networks of parallel processes. In: Gilchrist, B. (ed.) Information Processing 1977, pp. 993–998. North-Holland, Amsterdam (1977)

    Google Scholar 

  19. Lucassen, P.G.: A Denotational Model and Composition Theorems for a Calculus of Delay-Insensitive Specifications. PhD Thesis, University of Groningen, Groningen, The Netherlands (1994)

    Google Scholar 

  20. Mallon, W.C.: Theories and Tools for the Design of Delay-Insensitive Communicating Processes. PhD Thesis, University of Groningen, Groningen, The Netherlands (2000)

    Google Scholar 

  21. Mazurkiewicz, A.: Concurrent Program Schemes and their Interpretation. Technical Report DAIMI PB-78, Århus University, Denmark (1977)

    Google Scholar 

  22. Olderog, E.-R., Hoare, C.A.R.: Specification-Oriented Semantics for Communicating Processes. Acta Informatica 23, 9–66 (1986)

    MATH  CrossRef  MathSciNet  Google Scholar 

  23. Panangaden, P., Shanbhogue, V.: The Expressive Power of Indeterminate Dataflow Primitives. Information and Computation 98, 99–131 (1992)

    MATH  CrossRef  MathSciNet  Google Scholar 

  24. Pratt, V.R.: On the composition of processes. In: Proc. 9th Annual ACM Symp. on Principles of Programming Languages, pp. 213–223 (1982)

    Google Scholar 

  25. Pratt, V.R.: Modeling Concurrency with Partial Orders. International Journal of Parallel Programming 15(1), 33–71 (1986)

    MATH  CrossRef  MathSciNet  Google Scholar 

  26. Roscoe, A.W.: Denotational semantics for occam. In: Brookes, S.D., Winskel, G., Roscoe, A.W. (eds.) Seminar on Concurrency. LNCS, vol. 197, pp. 306–321. Springer, Heidelberg (1985)

    Google Scholar 

  27. Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  28. Udding, J.T.: Classification and Composition of Delay-Insensitive Circuits. PhD Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands (1984)

    Google Scholar 

Download references

Author information

Affiliations

  1. Centre for Concurrent Systems and Very-Large-Scale Integration, Faculty of BCIM, London South Bank University, 103 Borough Road, London, SE1 0AA, UK

    Mark B. Josephs

Authors
  1. Mark B. Josephs
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and Permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Josephs, M.B. (2005). Models for Data-Flow Sequential Processes. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds) Communicating Sequential Processes. The First 25 Years. Lecture Notes in Computer Science, vol 3525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11423348_6

Download citation

  • DOI: https://doi.org/10.1007/11423348_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25813-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)