Skip to main content

Coordination of concurrent probabilistic processes

  • Conference paper
  • First Online:
Mathematical Theory of Networks and Systems

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 58))

Abstract

A "process" is an entity which can be described by a nondeterministic Turing machine. Several processes are "concurrent" if they mutually provide inputs to one another. An algebraic model has been developed which facilitates the analysis of the collective behavior of several concurrent processes. (This has been applied to development, specification and analysis of communication protocols.)

Here, it is described how the probabilistic behavior of such systems can be studied using the same underlying algebraic model. A model of probabilistic behavior can be utilized to reduce the complexity of system analysis and to provide the means to calculate average elapsed time between events, as well as the means to calculate the probability that an event or series of events will occur. This is applied to study the continuous time stochastic behavior of asynchronous systems.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Aggarwal, R. P. Kurshan, "Modelling Elapsed Time in Protocol Specification", Proc. IFIP Workshop on Protocol Specification, Testing and Verification, 1983.

    Google Scholar 

  2. S. Aggarwal, R. P. Kurshan, D. Sharma, "A Language for the Specification and Analysis of Protocols", Proc. IFIP Workshop on Protocol Specification, Testing and Verification, 1983.

    Google Scholar 

  3. P. Halmos, Lectures on Boolean Algebras, Springer-Verlag, N.Y. 1974.

    Google Scholar 

  4. R. P. Kurshan, B. Gopinath, "The Selection/Resolution Model for Concurrent Processes", preprint.

    Google Scholar 

  5. R. P. Kurshan, B. Gopinath, "Modelling Fully Distributed (Asynchronous) Concurrent Processes, preprint.

    Google Scholar 

  6. D. Lehmann, M. O. Rabin, "On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers problem", Record of 8th Ann. ACM Symp. on Principles of Programming Languages (1981) 133–138.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

P. A. Fuhrmann

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Kurshan, R.P. (1984). Coordination of concurrent probabilistic processes. In: Fuhrmann, P.A. (eds) Mathematical Theory of Networks and Systems. Lecture Notes in Control and Information Sciences, vol 58. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031086

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13168-7

  • Online ISBN: 978-3-540-38826-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics