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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
Broy, M.: A Theory for Nondeterminism, Parallelism, Communication, and Concurrency. Theoretical Computer Science 45, 1–61 (1986)
Broy, M., Lengauer, C.: On Denotational versus Predicative Semantics. Journal of Computer and System Sciences 42(1), 1–29 (1991)
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)
Gischer, J.L.: The Equational Theory of Pomsets. Theoretical Computer Science 62, 299–224 (1988)
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)
Hehner, E.C.R.: Predicative Programming Part II. Communications of the ACM 27(2), 144–151 (1984)
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)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Hoare, C.A.R., Jifeng, H.: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)
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)
Josephs, M.B.: Receptive process theory. Acta Informatica 29, 17–31 (1992)
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)
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)
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)
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)
Mallon, W.C.: Theories and Tools for the Design of Delay-Insensitive Communicating Processes. PhD Thesis, University of Groningen, Groningen, The Netherlands (2000)
Mazurkiewicz, A.: Concurrent Program Schemes and their Interpretation. Technical Report DAIMI PB-78, Århus University, Denmark (1977)
Olderog, E.-R., Hoare, C.A.R.: Specification-Oriented Semantics for Communicating Processes. Acta Informatica 23, 9–66 (1986)
Panangaden, P., Shanbhogue, V.: The Expressive Power of Indeterminate Dataflow Primitives. Information and Computation 98, 99–131 (1992)
Pratt, V.R.: On the composition of processes. In: Proc. 9th Annual ACM Symp. on Principles of Programming Languages, pp. 213–223 (1982)
Pratt, V.R.: Modeling Concurrency with Partial Orders. International Journal of Parallel Programming 15(1), 33–71 (1986)
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)
Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)
Udding, J.T.: Classification and Composition of Delay-Insensitive Circuits. PhD Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)