ausblenden:
Schlagwörter:
-
Zusammenfassung:
Computing the set of states backwards reachable from a given {\em
upward-closed}
set of initial states is decidable for infinite-state systems
like `unbounded' Petri Nets, Vector Addition Systems, Lossy Petri
Nets, and Broadcast Protocols.
An abstract algorithm that solves the problem is given by
When applied to this class of verification problems,
traditional symbolic model checking methods suffer from the state
explosion
problem even for very small examples.
We provide BDD-like data structure to represent in a compact way
collections of upwards closed sets over numerical domains.
This way, we turn the abstract algorithm of [ACJT96,FS99] into a
practical method.
Preliminary experimental results indicate the potential usefulness of
our method.
