Diagnosis of concurrent and asynchronous systems, such as large
telecommunication networks information systems, require powerful
mathematical models. The use of Petri net unfoldings allows to
formalize diagnosis using partially ordered time and local states for
each site. If, in addition to asynchronicity and distribution, the
topology of the system itself is subject to dynamic changes, all static
models, including Petri nets, reach their limits. The Graph Grammars
can be used instead for this purpose. Graph Grammars encode in their
current state not only the current values of the state variables but
also the current topology. Graph rewriting rules allow to encode both
change in state variables (or the move of tokens in nets) but also
changes in the net topology. Since Graph Grammars also possess an
unfolding theory, our previous approach to distributed and asynchronous
diagnosis extends to Graph Grammars as well. This paper presents the
above approach.
This work is partially supported by RNRT (National Research Network in Telecommunication) through the SWAN project (Self aWare mANagement).