The undecidability of Time Petri Nets (TPN) has been proven by showing that
they
can model zero-testability, which makes them equivalent to Turing machine, and
therefore reachability and boundedness for TPNs are undecidable.
However, if we restrict specficification of time intervals of its transitions
to
rational numbers, we obtain a model where reachability and boundedness are
decidable.
Interesting point is that the model under this restriction does not
lose zero-testability. So, how does the restriction to rational numbers goes
with the question of decidability in general?
Asif
----
[[ Petri Nets World: ]]
[[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/ ]]
[[ Mailing list FAQ: ]]
[[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/pnml/faq.html ]]
[[ Post messages/summary of replies: ]]
[[ [email protected] ]]
