Summary: Verification of Parameterized Timed Systems
Parosh Aziz Abdulla
Uppsala University, Sweden
parosh@it.uu.se
One of the prominent methods for program verification is that of model checking
[CES86,QS82]. In the last decade there has been an extensive research effort in order to
extend the applicability of model checking to systems with infinite state spaces. There are
at least two reasons why a system may be infinite­state:
-- A system may operate on data structures with unbounded domains. Examples in­
clude real­valued clocks in timed automata [AD94], stacks in push­down automata
[BEM97], queues in communicating processes [AJ96], counters in counter machines,
etc.
-- A system can also be infinite­state because it is parameterized. This means that the
description of the system is parameterized by the number of components inside the
system. In such a case, we would like to verify correctness of the system regardless
of the number of processes.
We consider systems which contain both sources of infiniteness; namely parameterized
systems of processes each of which behaves as a timed automaton.
Parameterized verification has recently received a lot of attention. One of the earliest
works for model checking of parameterized systems was reported by German and Sistla

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

Collections: Computer Technologies and Information Sciences