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.

Authors

Danièle Beauquier

This author has not been identified. Look up 'Danièle Beauquier' in Google

Anatol Slissenko

This author has not been identified. Look up 'Anatol Slissenko' in Google