Leslie Lamport
- E. A. Ashcroft. 1975. Proving assertions about parallel programs. J. Comput. Syst. Sci. 10, 1, 110–135. DOI: .Google Scholar
Cross Ref
- J. E. Burns, P. Jackson, N. A. Lynch, M. J. Fischer, and G. L. Peterson. 1982. Data requirements for implementation of N-process mutual exclusion using a single shared variable. J. ACM 29, 1, 183–205. DOI: .Google ScholarDigital Library
- P. J. Courtois, F. Heymans, and D. L. Parnas. 1971. Concurrent control with “readers” and “writers.” Commun. ACM 14, 10, 667–668. DOI: .Google ScholarDigital Library
- E. W. Dijkstra. 1965. Solution of a problem in concurrent programming control. Commun. ACM 8, 9, 569. DOI: .Google ScholarDigital Library
- E. W. Dijkstra. 1968. The structure of the “THE”-multiprogramming system. Commun. ACM 11, 5, 341–346. DOI: .Google ScholarDigital Library
- E. W. Dijkstra. 1971. Hierarchical ordering of sequential processes. Acta Inf. 1, 115–138. DOI: .Google ScholarDigital Library
- E. W. Dijkstra. November. 1974. Self-stabilizing systems in spite of distributed control. Commun. ACM 17, 11, 643–644. DOI: .Google ScholarDigital Library
- E. W. Dijkstra. 1984. Invariance and non-determinacy. Philos. Trans. R. Soc. Lond. A 312, 491–499. DOI: .Google ScholarCross Ref
- E. W. Dijkstra and C. S. Scholten. 1980. Termination detection for diffusing computations. Inf. Process. Lett. 11, 1, 1–4. DOI: .Google ScholarCross Ref
- E. W. Dijkstra, L. Lamport, A. J. Martin, C. S. Scholten, and E. F. M. Steffens. 1978. On-the fly garbage collection: An exercise in cooperation. Commun. ACM 21, 11, 966–975. DOI: .Google ScholarDigital Library
- E. W. Dijkstra, W. Feijen, and A. van Gasteren. 1983. Derivation of a termination detection algorithm for distributed computations. Inf. Process. Lett. 16, 5, 217–219. DOI: .Google ScholarCross Ref
- R. W. Floyd. 1967. Assigning meanings to programs. In Proceedings of the Symposium on Applied Mathematics, Vol. 19. American Mathematical Society, 19–32.Google Scholar
- N. Francez. 1979. On achieving distributed termination. In G. Kahn (Ed.), Semantics of Concurrent Computation, Proceedings of the International Symposium, Evian, France, July 2–4, 1979, Vol. 70: Lecture Notes in Computer Science. Springer, 300–315. DOI: .Google ScholarCross Ref
- D. Gries. 1977. An exercise in proving parallel programs correct. Commun. ACM 20, 12, 921–930. DOI: .Google ScholarDigital Library
- M. Herlihy. 1991. Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13, 1, 124–149. DOI: .Google ScholarDigital Library
- D. E. Knuth. 1966. Additional comments on a problem in concurrent program control. Commun. ACM 9, 5, 321–322. DOI: .Google ScholarDigital Library
- F. T. Krogh. May. 1979. ACM algorithms policy. Commun. ACM 22, 5, 329–330.Google Scholar
- L. Lamport. 1974a. A new solution of Dijkstra’s concurrent programming problem. Commun. ACM 17, 8, 453–455. DOI: .Google ScholarDigital Library
- L. Lamport. 1974b. On Self-Stabilizing Systems. Technical Report CA 7412-0511. Massachusetts Computer Associates. https://www.microsoft.com/en-us/research/publication/self-stabilizing-systems/.Google Scholar
- L. Lamport. 1977. Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng. SE-3, 2, 125–143. DOI: .Google ScholarDigital Library
- L. Lamport. 1986. The mutual exclusion problem: Part II. Statement and solutions. J. ACM 32, 1, 327–348. DOI: .Google ScholarDigital Library
- L. Lamport. 2003. Specifying Systems. Addison-Wesley, Boston. A link to an electronic copy can be found at http://lamport.org.Google Scholar
- L. Lamport, R. Shostak, and M. Pease. 1982. The Byzantine generals problem. ACM Trans. Program. Lang. Syst 4, 3, 382–401. DOI: .Google ScholarDigital Library
- S. Owicki and D. Gries. 1976. Verifying properties of parallel programs: An axiomatic approach. Commun. ACM 19, 5, 279–284. DOI: .Google ScholarDigital Library
Index Terms
- Concurrent Algorithms
Index terms have been assigned to the content through auto-classification.
Recommendations
New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets
Timed Petri nets are useful in performance evaluation of concurrent systems. The maximum computation rate is achieved for minimal cycle time of timed Petri net. It is known that minimal cycle time problem for P-invariant Petri nets is NP-complete. In ...
Structural and Dynamic Changes in Concurrent Systems: Reconfigurable Petri Nets
The aim of this work is the modeling and verification of concurrent systems subject to dynamic changes using extensions of Petri nets. We begin by introducing the notion of net rewriting system. In a net rewriting system, a system configuration is ...
Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems
Coloured Petri Nets (CPNs) is a language for the modelling and validation of systems in which concurrency, communication, and synchronisation play a major role. Coloured Petri Nets is a discrete-event modelling language combining Petri nets with the ...
Comments