MPI-I-1999-2-007

Symbolic representation of upward-closed sets

Delzanno, Giorgio and Raskin, Jean-Francois

MPI-I-1999-2-007. November 1999, 24 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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.

Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.	Attachement Size(s):
	361 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView

URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1999-2-007

BibTeX
@TECHREPORT{DelzannoRaskinMPI-I-1999-2-007, AUTHOR = {Delzanno, Giorgio and Raskin, Jean-Francois}, TITLE = {Symbolic representation of upward-closed sets}, TYPE = {Research Report}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany}, NUMBER = {MPI-I-1999-2-007}, MONTH = {November}, YEAR = {1999}, ISSN = {0946-011X},}