Paper Info
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.
Year
DOI
Venue
1992
10.1007/BFb0023864
LFCS
Keywords
Field
DocType
Data Dependent Programs,Infinite Paths
Integer,Discrete mathematics,Programming language,Computer science,Data dependent,Theoretical computer science,Decidability,Reachability problem
Conference
Volume
ISSN
ISBN
620
0302-9743
3-540-55707-5
Citations 
PageRank 
References 
4
3.38
7
Authors
1
Name
Order
Citations
PageRank
Karlis Cerans131448.74