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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Alur and D.Dili, Automata for Modelling Real-Time Systems, LNCS 443, 1990.
R. Alur, C.Courcoubetis and D.Dill, Model-Checking for Real-Time Systems, Proceedings from LICS'90 pp. 414–425, 1990.
A. Auzinš, J. Bārzdinš, J. Bičevskis, K. Čerāns and A. Kalninš, Automatic Construction of Test Sets: Theoretical Approach, in Baltic Computer Science, LNCS, No. 502, 1991.
J.M.Barzdin, J.J.Bicevskis, A.A.Kalninsh, Automatic Construction of Complete Sample Systems for Program Testing, Proc. IFIP Congress, 1977, North-Holland 1977.
B. Berthomieu and M.Menasche, An Enumerative Approach for Analyzing Time Petri Nets, Proc. IFIP Congress, 1983, North-Holland, 1983.
CCITT Specification and Description Language (SDL), Recomendations Z.100, 1988.
K. Čerāns, Reachability in Programs With Real Time, manuscript, 1991.
K. Čerāns, Decidability of Bisimulation Equivalence for Parallel Timed Processes, in Proc. of Chalmers Workshop on Concurrency, Göteborg, 1991.
K. Čerāns, Decidability of Bisimulation Equivalences for Processes With Parallel Timers, technical report, Institute of mathematics and Computer Science, University of Latvia, Riga, 1992.
K. Čerāns, Algorithmic Problems in Analysis of Real Time System Specifications, theses for a Dr.Sc.comp degree, to appear, University of Latvia, Riga, 1992.
C.Ghezzi, D.Mandrioli, S.Morasca and M.Pezze A General Way To Put Time in Petri Nets, ACM SIGSOFT Eng. Notes, Vol. 14, No. 3, 1989.
P. Merlin and D.J. Farber, Recoverability of Communication Protocols, IEEE Trans. on Communication Protocols, Vol. COM-24, No. 9, 1976.
M.L.Minsky, Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs, N.Y., 1967.
Yi Wang, Real Time Behaviour of Asynchronous Agents, LNCS No. 458, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Čerāns, K. (1992). Feasibility of finite and infinite paths in data dependent programs. In: Nerode, A., Taitslin, M. (eds) Logical Foundations of Computer Science — Tver '92. LFCS 1992. Lecture Notes in Computer Science, vol 620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023864
Download citation
DOI: https://doi.org/10.1007/BFb0023864
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55707-4
Online ISBN: 978-3-540-47276-6
eBook Packages: Springer Book Archive