A case study in Timed CSP: the railroad crossing problem

Lai, Luming and Watson, Phil (1997) A case study in Timed CSP: the railroad crossing problem. In: Maler, O., ed. Hybrid and Real-Time Systems. Lecture Notes in Computer Science, 1201. Springer Verlag pp. 69-74. ISBN 3-540-62600-X. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1007/BFb0014714

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.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: specification, real-time systems
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 25 Jul 2009 15:34
Last Modified: 25 Jun 2014 11:15
Resource URI: https://kar.kent.ac.uk/id/eprint/21547 (The current URI for this page, for reference purposes)
  • Depositors only (login required):