The Generalized Railroad Crossing: A Case Study in Formali Verification of Real-time Systems
dc.contributor.author | Heitmeyer, Constance | en_US |
dc.contributor.author | Lynch, Nancy A. | en_US |
dc.date.accessioned | 2023-03-29T14:38:14Z | |
dc.date.available | 2023-03-29T14:38:14Z | |
dc.date.issued | 1994-11 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/149229 | |
dc.description.abstract | A new solution to the Generalized Railroad Crossing problem, based on timed automata, invariants and simulation mappings, is presented and evaluated. The solution shows formally the correspondence between four system descriptions: an axiomatic specification, an operational specification, a discrete system implementation, and a system implementation that works with a continuous gate model. | en_US |
dc.relation.ispartofseries | MIT-LCS-TM-511 | |
dc.title | The Generalized Railroad Crossing: A Case Study in Formali Verification of Real-time Systems | en_US |