Abstract
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to find approaches to automatize model checking in high level, easily understandable languages. We give here a general notion of timed transition system and its formula representation that are sufficient to deal with some known examples of timed algorithms. We prove that the general semantics gives the same executions as direct, more intuitive interpretations of executions of algorithms. In a way, we try to give a general treatment of considerations of Yu.Gurevich and his co-authors concerning concrete Gurevich machines (called evolving algebras in [Gur95]), in particular, related to Railroad Crossing Problem [GH96]. Besides that we formalize specifications of this problem in a high level language which permits to rewrite directly natural language formulations, and to give a formal proof of correctness of the railroad crossing algorithm using rather a small amount of logical means, and this leads to hypotheses how automatize inference search.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Alur, C. Courcoubetis, T. Henzinger, and P.-H. Ho. Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. In R.L. Grossman, A. Nerode, A.P. Ravn, and H. Rischel, editors, Workshop on Theory of Hybrid Systems, 1992, pages 209–229. Springer Verlag, 1993. Lect. Notes in Comput. Sci, vol. 736.
R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
D. Beauquier and A. Slissenko. The railroad crossing problem: Towards semantics of timed algorithms and their model checking in high level languages. TR-96-10, Dept. of Informatics, Univ. Paris-12, 24p., 1996.
A. Emerson. Temporal and model logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Vol. B: Formal Models and Sematics, pages 995–1072. Elsevier Science Publishers B.V., 1990.
A. Emerson. Automated temporal reasoning about reactive systems. In F. Moller and G. Birtwistle, editors, Logic for Concurrency. Structure versus Automata, pages 41–101. Springer-Verlag, 1996. Series: “Lecture notes in Computer Science (Tutorial)”, Vol. 1043.
Yu. Gurevich and J. Huggins. The railroad crossing problem: an experiment with instantaneous actions and immediate reactions. In Buning, H. K., editor, Computer Science Logics, Selected papers from CSL'95, pages 266–290. Springer-Verlag, 1996. Lect. Notes in Comput. Sci, vol. 1092.
Yu. Gurevich. Evolving algebra 1993: Lipari guide. In E. Börger, editor, Specification and Validation Methods, pages 9–93. Oxford University Press, 1995.
H. A. Hansson. Time and Probability in Formal Design of Distributed Systems. Elsevier, 1994. Series: “Real Time Safety Critical System”, vol. 1. H. Zedan, Series Ed.
R. Milner. Operational and algebraic semantics of concurrent processes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Vol. B: Formal Models and Sematics, pages 1201–1242. Elsevier Science Publishers B.V., 1990.
Z. Manna and A. Pnueli. Temporal Logic of Reactive and Concurrent Systems: Specification. Springer Verlag, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beauquier, D., Slissenko, A. (1997). The Railroad Crossing Problem: Towards semantics of timed algorithms and their model checking in high level languages. In: Bidoit, M., Dauchet, M. (eds) TAPSOFT '97: Theory and Practice of Software Development. CAAP 1997. Lecture Notes in Computer Science, vol 1214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030597
Download citation
DOI: https://doi.org/10.1007/BFb0030597
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62781-4
Online ISBN: 978-3-540-68517-3
eBook Packages: Springer Book Archive