Advertisement

On the formal specification and analysis of loosely connected processes

  • Raymond E. Miller
  • Chee K. Yap
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 75)

Abstract

Two formulations for synchronization problems, called "system of processes" and "synchronization graphs" are introduced in this paper. These are used to express inherent formal properties for such systems and give a set of inherent requirements for the mutual exclusion problem. Results include two theorems on common data requirements for mutual exclusion.

Keywords

Normal Transition Critical Region Mutual Exclusion Computation Path Synchronization Problem 
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]
    Bernstein, A.J., "Analysis of Programs for Parallel Processing," IEEE Trans. Electronic Computers, Vol. EC-15 (October 1966) 757–763.Google Scholar
  2. [2]
    Dijkstra, E.W., "Solution of a Problem in Concurrent Programming Control," Comm. ACM 8 (September 1965) pg. 569.Google Scholar
  3. [3]
    Dijkstra, E.W., "Co-operating Sequential Processes," in Programming Languages, (F. Genuys, Ed.), New York, Academic Press (1968) 43–112.Google Scholar
  4. [4]
    Gilbert, Philip and W. J. Chandler, "Interference Between Communicating Parallel Processes," C.ACM 15, No. 6 (June, 1972) 427–437.Google Scholar
  5. [5]
    Karp, R.M. and R.E. Miller, "Parallel Program Schemata," JCSS 3 (May, 1969) pp. 147–195.Google Scholar
  6. [6]
    Lamport, L., "On Concurrent Reading and Writing," Report CA-7409-0511, Massachusetts Computer Associates, Inc., September 1974, revised March 1976.Google Scholar
  7. [7]
    Lamport, L., "Time, Clocks and the Ordering of Events in a Distributed System", Report CA-7603-2911, Massachusetts Computer Associates, Inc., March 1976.Google Scholar
  8. [8]
    Lipton, Richard J., "On Synchronization Primitive Systems," Ph.D. Thesis, Carnegie-Mellon University, 1973 and Research Report #22, Yale University, Department of Computer Science, October 1973.Google Scholar
  9. [9]
    Miller, R.E., "Relationships Among Models of Parallelism and Synchronization," to appear in Proceedings of Symposium on Petri Nets and Related Methods, July 1975.Google Scholar
  10. [10]
    Miller, R. E. and C. K. Yap, "On Formulating Simultaneity for Studying Parallelism and Synchronization," Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, May, 1978. pp. 105–113.Google Scholar
  11. [11]
    Peterson, G.L. and M.J. Fischer, "Economical Solutions for the Critical Section Problem in a Distributed System, extended abstract." Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, May 1977, 91–97.Google Scholar
  12. [12]
    Rivest, R.L. and V.R. Pratt, "The Mutual Exclusion Problem for Unreliable Processes: Preliminary Report." Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science, October, 1976, 1–8.Google Scholar
  13. [13]
    Yap, C.K., "On Abstract Synchronization Problems and Synchronization Systems." Unpublished manuscript, 1976.Google Scholar
  14. [14]
    Zave, Pamela, "On the Formal Definition of Processes." Proceedings of International Conference on Parallel Processing, 1976.Google Scholar
  15. [15]
    Zave, Pamela and D.R. Fitzwater, "Specification of Asynchronous Interactions Using Primitive Functions." Technical Report, Dept. of Computer Science, University of Maryland, 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Raymond E. Miller
    • 1
  • Chee K. Yap
    • 2
  1. 1.Mathematical Sciences DepartmentIBM T. J. Watson Research CenterYorktown Heights
  2. 2.Computer Science DepartmentYale UniversityNew Haven

Personalised recommendations