Part of the Lecture Notes in Computer Science book series (LNCS, volume 1201)
A case study in timed CSP: The railroad crossing problem
We use timed CSP, which is an extension of the formal method CSP to problems with a real-time component, to tackle a benchmark problem for real-time systems, the railroad crossing problem.
Unable to display preview. Download preview PDF.
- 1.J. Davies. Specification and Proof in Real-Time CSP. D.Phil thesis, Computing Laboratory, Oxford University, published by Cambridge University Press, 1993.Google Scholar
- 2.J. Davies. Setting real-time CSP. Internal note, Computing Laboratory, Oxford University, 1994.Google Scholar
- 3.A.S. Evans, D.R.W. Holton, L. Lai and P. Watson. A comparison of formal real-time specification languages. In Proceedings of the Northern Formal Methods Work-shop, Ilkley, UK, 1996.Google Scholar
- 4.C.L. Heitmeyer and N. Lynch. The generalized railroad crossing: a case study in formal verification of real-time systems. NRL Memorandum Report NRL/MR/5540-94-7619, Navy Research Laboratory, Washington DC, USA, 1994.Google Scholar
- 5.C.L. Heitmeyer and D. Mandrioli (eds.). Formal Methods for Real-Time Computing. John Wiley & Sons, 1996.Google Scholar
- 6.C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall International, London, 1985.Google Scholar
- 7.L. Lai, P. Watson, A case study in Timed CSP: the Railroad Crossing Problem, Technical Report CS-01-97, Dept. of Computing, University of Bradford, January 1997.Google Scholar
- 8.I. Lee, H. Ben-Abdallah and J. Choi. A process algebraic method for the specification and analysis of real-time systems. In Google Scholar
- 9.W.D. Young. Modelling and verification of a simple real-time railroad gate controller. In M.G. Hinchey and J.P. Bowen (eds.), Applications of Formal Methods, Prentice Hall, 1995.Google Scholar
© Springer-Verlag Berlin Heidelberg 1997