Summary: Undecidability of LTL for Timed Petri Nets
Parosh Aziz Abdulla Aletta Nyl'en
Department of Information Technology
Uppsala University, Sweden
fparosh, alettag@it.uu.se
Abstract
We show undecidability of (action based) linear­time temporal logic
(LTL) for timed Petri nets. This is to be contrasted with decidability
of both the problem of checking safety properties for timed Petri nets,
and the problem of checking LTL formulae for (untimed) Petri nets. The
undecidability result is shown through a reduction from a similar problem
for lossy counter machines [May00]. The reduction is a modification of the
reduction used in [RGdFE99] for proving undecidability of reachability for
timed Petri nets.
1 Introduction
In this paper we show undecidability of (action based) linear­time temporal logic
(LTL) for Timed Petri Nets (TPNs). The model of TPNs is a generalization
of standard Petri nets in the sense that each token is equipped with a real­
valued clock representing the age of the token. Furthermore each arc in the
net is provided with an interval restricting the ages of tokens allowed to travel

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

Collections: Computer Technologies and Information Sciences