article

Free access

Solution of a problem in concurrent programming control

Author:

E. W. DijkstraAuthors Info & Claims

Communications of the ACM, Volume 8, Issue 9

Page 569

https://doi.org/10.1145/365559.365617

Published: 01 September 1965 Publication History

PDF eReader

Abstract

No abstract available.

Cited By

View all

Baiardi MBurattini SCiatto GPianini DOmicini ARicci ADastani MSichman JAlechina NDignum V(2024)Concurrency Model of BDI Programming Frameworks: Why Should We Control It?Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3663089(2147-2149)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3663089
Nigro LCicirelli F(2024)Property assessment of Peterson's mutual exclusion algorithmsApplied Computing and Intelligence10.3934/aci.20240054:1(66-92)Online publication date: 2024
https://doi.org/10.3934/aci.2024005
Nigro LCicirelli F(2024)Correctness Verification of Mutual Exclusion Algorithms by Model CheckingModelling10.3390/modelling50300375:3(694-719)Online publication date: 28-Jun-2024
https://doi.org/10.3390/modelling5030037
Show More Cited By

Index Terms

Solution of a problem in concurrent programming control
1. Computing methodologies
  1. Concurrent computing methodologies
    1. Concurrent programming languages
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Concurrent programming languages

Recommendations

Concurrent programming vs. concurrency control: shared events or shared data
Proceedings of the ACM SIGPLAN Workshop on Object-Based Concurrent Programming

Two views of concurrency in an object system exist. Those pursuing concurrent programming believe that activities in the real world are inherently concurrent and therefore objects are themselves active. Objects engage in shared events by sending and ...
Type-theoretic foundations for concurrent object-oriented programing

A number of attempts have been made to obtain type systems for object-oriented programming. The view that lies common is “object-oriented programming = λ-calculus + record.” Based on an analogous view “concurrent object-oriented programming = concurrent ...
A compact linear programming formulation of the maximum concurrent flow problem

We present an alternative linear programming formulation of the maximum concurrent flow problem MCFP termed the triples formulation. The standard formulations in the literature are the edge-path and node-edge formulations, which are known to be ...

Comments

Information & Contributors

Information

Published In

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1965

Published in CACM Volume 8, Issue 9

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

774
Total Citations
View Citations
7,553
Total Downloads

Downloads (Last 12 months)1,175
Downloads (Last 6 weeks)192

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Baiardi MBurattini SCiatto GPianini DOmicini ARicci ADastani MSichman JAlechina NDignum V(2024)Concurrency Model of BDI Programming Frameworks: Why Should We Control It?Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3663089(2147-2149)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3663089
Nigro LCicirelli F(2024)Property assessment of Peterson's mutual exclusion algorithmsApplied Computing and Intelligence10.3934/aci.20240054:1(66-92)Online publication date: 2024
https://doi.org/10.3934/aci.2024005
Nigro LCicirelli F(2024)Correctness Verification of Mutual Exclusion Algorithms by Model CheckingModelling10.3390/modelling50300375:3(694-719)Online publication date: 28-Jun-2024
https://doi.org/10.3390/modelling5030037
Nigro L(2024)Formal Modeling and Verification of Lycklama and Hadzilacos’s Mutual Exclusion AlgorithmMathematics10.3390/math1216244312:16(2443)Online publication date: 6-Aug-2024
https://doi.org/10.3390/math12162443
Hao YXing ZChai SCui LChai R(2024)Hierarchical Trajectory Optimization Method Based on Dynamic Potential Fields in Complex Scenarios2024 43rd Chinese Control Conference (CCC)10.23919/CCC63176.2024.10661702(1639-1644)Online publication date: 28-Jul-2024
https://doi.org/10.23919/CCC63176.2024.10661702
Gandham BAlapati P(2024)Scalable Compact NUMA-aware Lock2024 23rd International Symposium on Parallel and Distributed Computing (ISPDC)10.1109/ISPDC62236.2024.10705400(1-8)Online publication date: 8-Jul-2024
https://doi.org/10.1109/ISPDC62236.2024.10705400
Ebel HRosenfelder MEberhard P(2024)Cooperative object transportation with differential-drive mobile robotsRobotics and Autonomous Systems10.1016/j.robot.2023.104612173:COnline publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1016/j.robot.2023.104612
Durand ARaynal MTaubenfeld G(2024)Better Sooner Rather Than LaterStructural Information and Communication Complexity10.1007/978-3-031-60603-8_13(226-237)Online publication date: 27-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-60603-8_13
Hafidi YKeiren JGroote J(2024)Fair Mutual Exclusion for N ProcessesTools and Methods of Program Analysis10.1007/978-3-031-50423-5_14(149-160)Online publication date: 3-Jan-2024
https://doi.org/10.1007/978-3-031-50423-5_14
Hoppe IHagemann WStierand IHahn ABolles A(2024)Challenges for trustworthy autonomous vehicles: Let us learn from lifeSystems Engineering10.1002/sys.2174427:4(789-800)Online publication date: 8-Feb-2024
https://doi.org/10.1002/sys.21744
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

Concurrent programming vs. concurrency control: shared events or shared data

Type-theoretic foundations for concurrent object-oriented programing

A compact linear programming formulation of the maximum concurrent flow problem

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations