No label defined (Q3974867)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 17543
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 17543

      Statements

      0 references
      0 references
      0 references
      26 June 1992
      0 references
      Petri nets
      0 references
      [For the entire collection see Zbl 0726.00019.] The modelling power of normal and sinkless Petri nets is examined and compared with that of conflict-free and persistent ones. In particular, it is shown that neither a more general producer/consumer problem nor the mutual exclusion problem can be modeled by persistent Petri nets. But although the mutual exclusion problem cannot be modeled even by sinkless Petri nets, the generalized producer/consumer problem and a version of the mutual exclusion problem in which the total number of exclusions in many computation is bounded by a fixed constant both can be modeled by normal Petri nets and hence by sinkless ones. Moreover persistent ones cannot model one exclusion. Later the complexity problems are examined. It is argued that normal and sinkless Petri nets are easier to analyze than persistent Petri nets. Doing so techniques originally developed for conflict-free Petri nets --- a class defined solely in terms of the structure of the net --- to sinkless Petri nets --- a class defined in terms of behavior of the net are applied. As a result the first comprehensive complexity analysis of a class of potentially unbounded Petri nets defined in terms of their behaviour is given.
      0 references

      Identifiers