License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2009.2331
URN: urn:nbn:de:0030-drops-23314
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2331/
Go to the corresponding LIPIcs Volume Portal

Praveen, M. ; Lodaya, Kamal

Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE

pdf-format:
09005.PraveenM.2331.pdf (0.3 MB)

Abstract

We consider concurrent systems that can be modelled as $1$-safe
Petri nets communicating through a fixed set of buffers (modelled as
unbounded places). We identify a parameter $\ben$, which we call
``benefit depth'', formed from the communication graph between the
buffers. We show that for our system model, the coverability and boundedness
problems can be solved in polynomial space assuming $\ben$ to be a
fixed parameter, that is, the space requirement is $f(\ben)p(n)$,
where $f$ is an exponential function and $p$ is a polynomial in
the size of the input. We then obtain similar complexity bounds for
modelchecking a logic based on such counting properties.
This means that systems that have sparse communication patterns can
be analyzed more efficiently than using previously
known algorithms for general Petri nets.

BibTeX - Entry

@InProceedings{praveen_et_al:LIPIcs:2009:2331,
  author =	{M. Praveen and Kamal Lodaya},
  title =	{{Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
  pages =	{347--358},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-13-2},
  ISSN =	{1868-8969},
  year =	{2009},
  volume =	{4},
  editor =	{Ravi Kannan and K. Narayan Kumar},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2331},
  URN =		{urn:nbn:de:0030-drops-23314},
  doi =		{10.4230/LIPIcs.FSTTCS.2009.2331},
  annote =	{Keywords: Petri nets, Coverability, Boundedness, paraPSPACE}
}

Keywords: Petri nets, Coverability, Boundedness, paraPSPACE
Collection: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
Issue Date: 2009
Date of publication: 14.12.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI