License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.SynCoP.2015.103
URN: urn:nbn:de:0030-drops-56046
URL: https://drops.dagstuhl.de/opus/volltexte/2015/5604/
Go to the corresponding OASIcs Volume Portal


David, Nicolas ; Jard, Claude ; Lime, Didier ; Roux, Olivier H.

Discrete Parameters in Petri Nets (Informal Presentation)

pdf-format:
2.pdf (0.3 MB)


Abstract

With the aim of significantly increasing the modeling capability of Petri nets, we suggest models that involve parameters to represent the weights of arcs, or the number of tokens in places. We call these Petri nets parameterised nets or PPNs. Indeed, the introduction of parameters in models aims to improve genericity. It therefore allows the designer to leave unspecified aspects, such as those related to the modeling of the environment. This increase in modeling power usually results in greater complexity in the analysis and verification of the model. Here, we consider the property of coverability of markings. Two general questions arise: "Is there a parameter value for which the property is satisfied?" and "Does the property hold for all possible values of the parameters?". We first study the decidability of these issues, which we show to be undecidable in the general case. Therefore, we also define subclasses of parameterised networks, based on restriction of the use of parameters, depending on whether the parameters are used on places, input or output arcs of transitions or combinations of them. Those subclasses have therefore a dual interest. From a modeling point of view, restrict the use of parameters to tokens, outputs or inputs can be seen as respectively processes or synchronisation of a given number of processes. From a theoretical point of view, it is interesting to introduce those subclasses of PPN in a concern of completeness of the study. We study the relations between those subclasses and prove that, for some subclasses, certain problems become decidable, making these subclasses more usable in practice.

BibTeX - Entry

@InProceedings{david_et_al:OASIcs:2015:5604,
  author =	{Nicolas David and Claude Jard and Didier Lime and Olivier H. Roux},
  title =	{{Discrete Parameters in Petri Nets (Informal Presentation)}},
  booktitle =	{2nd International Workshop on Synthesis of Complex Parameters (SynCoP'15)},
  pages =	{103--103},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-82-8},
  ISSN =	{2190-6807},
  year =	{2015},
  volume =	{44},
  editor =	{{\'E}tienne Andr{\'e} and Goran Frehse},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5604},
  URN =		{urn:nbn:de:0030-drops-56046},
  doi =		{10.4230/OASIcs.SynCoP.2015.103},
  annote =	{Keywords: Petri nets, Parameters, Coverability}
}

Keywords: Petri nets, Parameters, Coverability
Collection: 2nd International Workshop on Synthesis of Complex Parameters (SynCoP'15)
Issue Date: 2015
Date of publication: 03.12.2015


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