Skip to main content

Critical remarks on max model of concurrency

  • Conference paper
  • First Online:
Logics of Programs (Logic of Programs 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 131))

Included in the following conference series:

  • 131 Accesses

Abstract

A few critical remarks on a mathematical model of concurrency are discussed. As the result we were able to improve the model, to state new problems to be studied later on and to remark that the ideas of our model can be applied to the tasking of ADA, CSP and CCS. It means that apart of standard semantics of ADA there is another one and it is not obvious which semantics is more natural.

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. ADA. report on the programming language. DoD Washington, July 1980

    Google Scholar 

  2. Arjomandi E. Fischer M., Lynch N., A difference in Efficiency between Synchronous and Asynchronous Systems. 13-th ACM STOC Symp. Milwaukee, 1981

    Google Scholar 

  3. Bartol W.M. et al. LOGLAN'79 report on the programming language T.Müldner ed. to appear in Lecture Notes on Computer Science

    Google Scholar 

  4. Burkhard H.D., On priorities of parallelism: Petri nets under the Maximum Firing Strategy, to appear in proceedings of Symp on Algorithmic logic and LOGLAN. Poznań 1980

    Google Scholar 

  5. Cousot. P., personal communication

    Google Scholar 

  6. Fischer M., Lynch N., On describing the behaviour and implementation of distributed systems. Theoretical Computer Science 13 1981 17–43

    Article  Google Scholar 

  7. Hoare C.A.R., Communicating systems programming CACM 21 1978 no 8

    Google Scholar 

  8. Kozen D., personal communication

    Google Scholar 

  9. Kwong Y.S., On the absence of livelocks in parallel programs in Proc Symp. Semantics Conc. Computations Lecture Notes in Computer Sci. vol. 70 Springer. Berlin, 1979

    Google Scholar 

  10. Lamport L., "Sometimes" is sometimes "Not Never", in Proc 7th ACM POPL Symp.. Las Vegas. 1980

    Google Scholar 

  11. Milner R., A calculus of communicating Systems, Lecture Notes in Computer Science, Springer, Berlin, 1980

    Google Scholar 

  12. MirkowskaG., Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondezetministic Interpretations 12th ACM STOC Symp., Los Angeles, 1980

    Google Scholar 

  13. Mirkowska g., Model existence theorem in algorithmic logic with nondeterministic programs. Fundamenta Informaticae 3 1980 157–170

    Google Scholar 

  14. Müldner T., On semantics of parallel programs, ICS PAS Reports 323 Warasw. 1979 to appear in Fundamenta Informaticae

    Google Scholar 

  15. Müldner T., On properties of certain synchronizing tool for parallel computations. FCT'77 M. Karpiński ed. Lecture Notes on Comp. Science vol 56. Springer. Berlin. 1977, 459–465

    Google Scholar 

  16. Müldner T., Salwicki A., On algorithmic properties of concurrent programs to appear in Proc Sem on ALg Logic Zürich 79 E. Engeler ed. Lecture Notes on Computer Science Springer

    Google Scholar 

  17. Reif J., Spriakis P., Distributed Algorithms for Synchronizing Interprocess Communication Within Real Time. 13th ACM STOC Symp.

    Google Scholar 

  18. Salwicki A., Applied Algorithmic Logic in Proc MFCS'77 ed. J. Gruska Lecture Notes on Computer Science vol 53, Springer. Berlin, 1977 352–363

    Google Scholar 

  19. Salwicki A., On algorithmic logic and its applications, to appear

    Google Scholar 

  20. Stapp L., On synchronization of philosophers, manuscript, Warsaw Technical University, 1981

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dexter Kozen

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salwicki, A. (1982). Critical remarks on max model of concurrency. In: Kozen, D. (eds) Logics of Programs. Logic of Programs 1981. Lecture Notes in Computer Science, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025793

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11212-9

  • Online ISBN: 978-3-540-39047-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics