This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
7. References
Behzad M., Chartrand G., Lesniak-Foster L., Graphs and Digraphs, Wadsworth International Group, Belmont, 1981.
Devillers R., The Train Set Strikes Again!, Report ASM/105, Comp. Lab., Univ. of Newcastle upon Tyne, 1982.
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.
Koutny M., On the Merlin-Randell Problem, Ph. D. Thesis, Institute of Mathematics, Warsaw Technical University, 1984, (in Polish).
Merlin P., Randell B., Notes of Deadlock Avoidance on the Train Set, Report MRM/144, Comp. Lab., Univ. of Newcastle upon Tyne, 1978.
Randell B., Safe Train Journeys, Report MRM/139, Comp. Lab., Univ. of Newcastle upon Tyne, 1978.
Shields M.W., COSY Train Journeys, Report ASM/67, Comp. Lab., Univ. of Newcastle upon Tyne, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koutny, M. (1984). On the Merlin-Randell problem of train journeys. In: Paul, M., Robinet, B. (eds) International Symposium on Programming. Programming 1984. Lecture Notes in Computer Science, vol 167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12925-1_38
Download citation
DOI: https://doi.org/10.1007/3-540-12925-1_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12925-7
Online ISBN: 978-3-540-38809-8
eBook Packages: Springer Book Archive