skip to main content
research-article

TLRO based modeling of alternative commands and its application to generalized distributed resource allocation problem

Published: 14 November 2011 Publication History

Abstract

There are systems where alternative constructs need to be used for its description. In weakest precondition calculus disjunction of the post conditions of constituent guarded commands is used as the post condition of an alternative construct. Such representation is not suitable because it does not express a one to one correspondence between a guard and the relevant component of the characterized post condition. In this paper Temporal Logic Related to Observation (TLRO) is used to solve this problem. Each guarded command is expressed as a TLRO rule by using its strongest post condition and the corresponding precondition. List of these representations for all the constituent guarded commands is the required model. Technique is illustrated by considering a common sense scenario. The scheme is then applied to a generalized resource allocation algorithm which is a weaker version of Drinking Philosophers problem.

References

[1]
Anup Kumar Bandyopadhyay. 2010. Modeling of state transition rules and its application. SIGSOFT Softw. Eng. Notes 35, 2 (March 2010), 1--7.
[2]
Anup Kumar Bandyopadhyay and Nibedita Lenka. 2010. Application of TLRO to dining philosophers problem. SIGSOFT Softw. Eng. Notes 35, 6 (November 2010), 1--6.
[3]
Peterson Gary L. 1981. Myths about the mutual exclusion problem, Information Processing Letters, vol. 12, No. 3, 115--116
[4]
Edsger Wybe Dijkstra. 1997. A Discipline of Programming (1st ed.). Prentice Hall PTR, Upper Saddle River, NJ, USA.
[5]
Edsger W. Dijkstra. 1975. Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM 18, 8 (August 1975), 453--457.
[6]
Anup Kumar Bandyopadhyay. 2007. Modeling fairness and starvation in concurrent systems. SIGSOFT Softw. Eng. Notes 32,6, Article 2 (November 2007).
[7]
Fred B. Schneider. 1997. On Concurrent Programming. Springer-Verlag New York, Inc., New York, NY, USA.
[8]
K. M. Chandy and J. Misra. 1984. The drinking philosophers problem. ACM Trans. Program. Lang. Syst. 6, 4 (October 1984), 632--646.
[9]
Leslie Lamport. 1978. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 7 (July 1978), 558--565.
[10]
Glenn Ricart and Ashok K. Agrawala. 1981. An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24, 1 (January 1981), 9--17.

Cited By

View all
  • (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

Index Terms

  1. TLRO based modeling of alternative commands and its application to generalized distributed resource allocation problem

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM SIGSOFT Software Engineering Notes
      ACM SIGSOFT Software Engineering Notes  Volume 36, Issue 6
      November 2011
      117 pages
      ISSN:0163-5948
      DOI:10.1145/2047414
      Issue’s Table of Contents

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 14 November 2011
      Published in SIGSOFT Volume 36, Issue 6

      Check for updates

      Author Tags

      1. alternative command
      2. drinking philosophers problem
      3. resource allocation algorithm
      4. system modeling
      5. temporal logic

      Qualifiers

      • Research-article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 07 Mar 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (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

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media