Summary: Model Checking of Systems with
Many Identical 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
directed towards the automatic verification of infinite state systems,
such as timed automata, hybrid automata, data­independent systems,
relational automata, Petri nets, lossy channel systems, context­free
and push­down processes. We present a method for deciding reach­
ability properties of networks of timed processes. Such a network
consists of an arbitrary set of identical timed automata, each with a
single real­valued clock. Using a standard reduction from safety prop­
erties 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 verification of systems that
are infinite­state in ``two dimensions'': they contain an arbitrary set of

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

Collections: Computer Technologies and Information Sciences