School of Computing

A case study in Timed CSP: the railroad crossing problem

L.M. Lai and P. Watson

In O. Maler, editor, Proceedings of the International Workshop on Hybrid and Real-Time Systems (HART 97), volume 1201 of Lecture Notes in Computer Science, pages 182-196. Springer Verlag, January 1997.

Abstract

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.



Bibtex Record

@inproceedings{732,
author = {L.M. Lai and P. Watson},
title = {A case study in {T}imed {CSP}: the railroad crossing problem},
month = {January},
year = {1997},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1997/732},
    booktitle = {Proceedings of the International Workshop on Hybrid and Real-Time Systems (HART 97)},
    editor = {O. Maler},
    publisher = {Springer Verlag},
    refereed = {Yes},
    series = {Lecture Notes in Computer Science},
    volume = {1201},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014