The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages

Danièle Beauquier, Anatol Slissenko. The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages. In Michel Bidoit, Max Dauchet, editors, TAPSOFT 97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings. Volume 1214 of Lecture Notes in Computer Science, pages 201-212, Springer, 1997.

@inproceedings{BeauquierS97,
  title = {The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages},
  author = {Danièle Beauquier and Anatol Slissenko},
  year = {1997},
  tags = {semantics, model checking, meta-model, modeling language, language modeling, Meta-Environment},
  researchr = {https://researchr.org/publication/BeauquierS97},
  cites = {0},
  citedby = {0},
  pages = {201-212},
  booktitle = {TAPSOFT 97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings},
  editor = {Michel Bidoit and Max Dauchet},
  volume = {1214},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-62781-2},
}