Lai, Luming, Watson, Phil (1997) A case study in Timed CSP: the railroad crossing problem. In: Maler, O., ed. Proceedings of the International Workshop on Hybrid and Real-Time Systems (HART 97). Lecture Notes in Computer Science , 1201. pp. 69-74. Springer Verlag ISBN 3-540-62600-X. (doi:10.1007/BFb0014714) (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) (KAR id:21547)
| 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. | |
| 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) |
|---|---|
| DOI/Identification number: | 10.1007/BFb0014714 |
| Uncontrolled keywords: | specification, real-time systems |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Institutional Unit: | Schools > School of Computing |
| Former Institutional Unit: |
Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
|
| Depositing User: | Mark Wheadon |
| Date Deposited: | 25 Jul 2009 15:34 UTC |
| Last Modified: | 20 May 2025 10:09 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/21547 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
