Advertisement

On the Merlin-Randell problem of train journeys

  • Maciej Koutny
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 167)

Keywords

Connected Graph Critical Path Critical Section Synchronisation Strategy Train System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. [BCL81]
    Behzad M., Chartrand G., Lesniak-Foster L., Graphs and Digraphs, Wadsworth International Group, Belmont, 1981.Google Scholar
  2. [D82]
    Devillers R., The Train Set Strikes Again!, Report ASM/105, Comp. Lab., Univ. of Newcastle upon Tyne, 1982.Google Scholar
  3. [JL82]
    Janicki R., Lauer P.E., Towards a Solution of the Merlin-Randell Problem of Train Journeys, Report ASM/95, Comp. Lab., Univ. of Newcastle upon Tyne, 1982.Google Scholar
  4. [K84]
    Koutny M., On the Merlin-Randell Problem, Ph. D. Thesis, Institute of Mathematics, Warsaw Technical University, 1984, (in Polish).Google Scholar
  5. [MR78]
    Merlin P., Randell B., Notes of Deadlock Avoidance on the Train Set, Report MRM/144, Comp. Lab., Univ. of Newcastle upon Tyne, 1978.Google Scholar
  6. [R78]
    Randell B., Safe Train Journeys, Report MRM/139, Comp. Lab., Univ. of Newcastle upon Tyne, 1978.Google Scholar
  7. [S79]
    Shields M.W., COSY Train Journeys, Report ASM/67, Comp. Lab., Univ. of Newcastle upon Tyne, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Maciej Koutny
    • 1
  1. 1.Institute of MathematicsWarsaw Technical UniversityWarsawPoland

Personalised recommendations