@inproceedings{eeb218e4310042bfa12222b3eb32260e,
title = "Feasibility of finite and infinite paths in data dependent programs",
abstract = "This paper considers the feasibility of finite and infinite paths in programs in two simple programming languages. The language LBASE allows to express the dependencies of real time systems on integer data, the language LTIM can model quantitative timing constraints in r.t.s. specifications. It is proven that the problem of whether a given LBASE or LTIM program has an infinite feasible path (i.e. whether it can exhibit an infinite behaviour) is decidable. The possibilities to characterise the sets of all feasible finite and infinite paths in LBASE and LTIM programs are also discussed. The infinite feasible path existence problem is proven decidable also for the language LTIBA which has both the LBASE and LTIM modelling capabilities.",
author = "Kārlis {\v C}erāns",
note = "Publisher Copyright: {\textcopyright} 1992, Springer Verlag. All rights reserved.; 2nd International Symposia on Logical Foundations of Computer Science, Tver 1992 ; Conference date: 20-07-1992 Through 24-07-1992",
year = "1992",
doi = "10.1007/BFb0023864",
language = "English",
isbn = "9783540557074",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "69--80",
editor = "Anil Nerode and Mikhail Taitslin",
booktitle = "Logical Foundations of Computer Science {\textemdash} Tver 1992 - 2nd International Symposium, Proceedings",
address = "Germany",
}