article

On the correctness issues in two-process mutual exclusion algorithms

Authors:

Jayasri Banerjee,

Anup Kumar Bandyopadhyay,

Ajit Kumar MandalAuthors Info & Claims

ACM SIGSOFT Software Engineering Notes, Volume 32, Issue 6

Pages 1 - es

https://doi.org/10.1145/1317471.1317473

Published: 01 November 2007 Publication History

Get Access

Abstract

Correctness issues in two process mutual exclusion algorithms are investigated. A new theorem is proposed and proved that describes the key concept involved in such algorithms. For the purpose of proving the techniques developed in [3] are used. Result of this theorem is applied to two different algorithms of which one could be proved incorrect. Technique developed in [3] is also used to prove the correct algorithm.

References

[1]

E. W. Dijkstra, A discipline of programming, Englewood Cliffs, NJ: Prentice- Hall, 1976.

Digital Library

Google Scholar

[2]

A. K. Bandyopadhyay and J. Bandyopadhyay, On the derivation of a correct deadlock free communication kernel for loop connected message passing architecture from its user's specification, ELSVIER Journal of System Architecture, 46(13), 2000, pp. 1257--1261.

Digital Library

Google Scholar

[3]

Jayasri Banerjee, Anup Kumar Bandyopadhyay and Ajit Kumar Mandal, "Ordering of Events in Two-Process Concurrent System", ACM SIGSOFT Software Engineering Notes, Vol. 32, No. 4, July 2007

Digital Library

Google Scholar

[4]

Jayadev Misra, A family of 2-process mutual exclusion algorithms, Notes on UNITY:13--90, http://www.cs.utexas.edu/users/psp/unity/notes/13-90.pdf., March 7, 1994.

Google Scholar

[5]

Gary L. Peterson, Myths about the mutual exclusion problem, Information Processing Letters, 12(3), June 1981, pp 115--116.

Crossref

Google Scholar

[6]

J. L. W. Kessels, "Arbitration without common modifiable variables", Acta Informatic, vol. 17, 1982, pp 135--141

Digital Library

Google Scholar

[7]

P. Pramanik, P. K. Das, A. K. Bandyopadhyay and D. Q. M. Fay, "A deadlock-free communication kernel for loop connected message passing computer architecture", Presented in Euromicro 1990. Also in Microprocessing and Microprogramming, Vol. 30, pp 703--712,. 1990

Google Scholar

[8]

H. Hymen, Comments on a problem in concurrent programming control, Comm. ACM, vol. 9(1), p 45, 1966.

Digital Library

Google Scholar

Cited By

View all

Bandyopadhyay A(2018)Weakest precondition based modelling and verification of a class of concurrent systemsInternational Journal of Artificial Intelligence and Soft Computing10.1504/IJAISC.2010.0325162:1/2(115-131)Online publication date: 13-Dec-2018
https://dl.acm.org/doi/10.1504/IJAISC.2010.032516
Bandyopadhyay A(2012)Application of TLRO to refute an incorrect mutual exclusion algorithmACM SIGSOFT Software Engineering Notes10.1145/2347696.234770237:5(1-5)Online publication date: 2-Sep-2012
https://dl.acm.org/doi/10.1145/2347696.2347702
Singh ABandyopadhyay A(2010)Specifying fault-tolerance using split precondition logicProceedings of the 11th international conference on Distributed computing and networking10.5555/2018057.2018112(466-472)Online publication date: 3-Jan-2010
https://dl.acm.org/doi/10.5555/2018057.2018112
Show More Cited By

Recommendations

Some investigations on deadlock freedom issues of a cyclically connected system using Dijkstra's weakest precondition calculus

Weakest precondition calculus is used to specify a system implemented by a cyclic interconnection of sequential processes. From this specification a predicate is derived that describes the deadlock freedom property of the system. Invariance of the ...
Weakest precondition based modelling and verification of a class of concurrent systems

A weakest precondition based modelling and verification technique for a class of concurrent systems is proposed. A system in this class is defined by a set of non-terminating interactive sequential processes. The constituent processes are allowed to ...
Verifying mutual exclusion and liveness properties with split preconditions
Abstract
This work is focused on presenting a split precondition approach for the modeling and proving the correctness of distributed algorithms. Formal specification and precise analysis of Peterson's distributed mutual exclusion algorithm for two process ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSOFT Software Engineering Notes

ACM SIGSOFT Software Engineering Notes Volume 32, Issue 6

November 2007

105 pages

ISSN:0163-5948

DOI:10.1145/1317471

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 2007

Published in SIGSOFT Volume 32, Issue 6

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
184
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bandyopadhyay A(2018)Weakest precondition based modelling and verification of a class of concurrent systemsInternational Journal of Artificial Intelligence and Soft Computing10.1504/IJAISC.2010.0325162:1/2(115-131)Online publication date: 13-Dec-2018
https://dl.acm.org/doi/10.1504/IJAISC.2010.032516
Bandyopadhyay A(2012)Application of TLRO to refute an incorrect mutual exclusion algorithmACM SIGSOFT Software Engineering Notes10.1145/2347696.234770237:5(1-5)Online publication date: 2-Sep-2012
https://dl.acm.org/doi/10.1145/2347696.2347702
Singh ABandyopadhyay A(2010)Specifying fault-tolerance using split precondition logicProceedings of the 11th international conference on Distributed computing and networking10.5555/2018057.2018112(466-472)Online publication date: 3-Jan-2010
https://dl.acm.org/doi/10.5555/2018057.2018112
Bandyopadhyay A(2009)Fairness and conspiracy concepts in concurrent systemsACM SIGSOFT Software Engineering Notes10.1145/1507195.150720334:2(1-8)Online publication date: 28-Feb-2009
https://dl.acm.org/doi/10.1145/1507195.1507203
Bandyopadhyay A(2007)Modeling fairness and starvation in concurrent systemsACM SIGSOFT Software Engineering Notes10.1145/1317471.131747432:6(2-es)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1145/1317471.1317474

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Some investigations on deadlock freedom issues of a cyclically connected system using Dijkstra's weakest precondition calculus

Weakest precondition based modelling and verification of a class of concurrent systems

Verifying mutual exclusion and liveness properties with split preconditions

Comments

Information

Published In

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations