de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Symbolic representation of upward-closed sets

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44290

Delzanno,  Giorgio
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

1999-2-007
(Any fulltext), 10KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Delzanno, G., & Raskin, J.-F.(1999). Symbolic representation of upward-closed sets (MPI-I-1999-2-007). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-6F56-9
Abstract
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.