Summary: Verifying Networks of Timed Processes
Parosh Aziz Abdulla Bengt Jonsson
Dept. of Computer Systems
P.O. Box 325
S­751 05 Uppsala, Sweden
fparosh,bengtg@docs.uu.se
Abstract
Over the last years there has been an increasing research effort di­
rected towards the automatic verification of infinite state systems, such
as timed automata, hybrid automata, data­independent systems, rela­
tional automata, Petri nets, and lossy channel systems. We present a
method for deciding reachability properties of networks of timed pro­
cesses. Such a network consists of an arbitrary set of identical timed
automata, each with a single real­valued clock. Using a standard re­
duction from safety properties to reachability properties, we can use
our algorithm to decide general safety properties of timed networks.
To our knowledge, this is the first decidability result concerning ver­
ification of systems that are infinite­state in ``two dimentions'': they
contain an arbitrary set of (identical) processes, and they use infinite
data­structures, viz. real­valued clocks. We illustrate our method by

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

Collections: Computer Technologies and Information Sciences