Summary: General Decidability Theorems for Infinite­State
Systems
(Extended Abstract)
Parosh Aziz Abdulla \Lambda
Uppsala University
K¯arlis Ÿ
Cer¯ans
University of Latvia
Bengt Jonsson
Uppsala University
Yih­Kuen Tsay
National Taiwan University
Abstract
Over the last few years there has been an increasing research effort directed towards
the automatic verification of infinite state systems. For different classes of such systems
(e.g., hybrid automata, data­independent systems, relational automata, Petri nets, and
lossy channel systems) this research has resulted in numerous highly nontrivial algo­
rithms. As the interest in this area increases, it will be important to extract common
principles that underly these and related results. This paper is concerned with iden­
tifying general mathematical structures which could serve as sufficient conditions for

Source: Abdulla, Parosh Aziz - Department of Information Technology, Uppsala Universitet

Collections: Computer Technologies and Information Sciences