Algorithmic Analysis of Programs with Well Quasi-ordered Domains

Parosh Aziz Abdulla, Kārlis Čerāns, Bengt Jonsson, Yih-Kuen Tsay
2000 Information and Computation  
Over the past few years increasing research effort has been directed towards the automatic verification of infinite-state systems. This paper is concerned with identifying general mathematical structures which can serve as sufficient conditions for achieving decidability. We present decidability results for a class of systems (called well-structured systems) which consist of a finite control part operating on an infinite data domain. The results assume that the data domain is equipped with a
more » ... order which is a well quasi-ordering, such that the transition relation is'm onotonic" (a simulation) with respect to the preorder. We show that the following properties are decidable for well-structured systems: v Reachability: whether a certain set of control states is reachable. Other safety properties can be reduced to the reachability problem.
doi:10.1006/inco.1999.2843 fatcat:7vkbq4w2jje6hmosmsgomumcuy