The residue of vector sets with applications to decidability problems in Petri nets (Q797285): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 11:05, 30 January 2024

scientific article
Language Label Description Also known as
English
The residue of vector sets with applications to decidability problems in Petri nets
scientific article

    Statements

    The residue of vector sets with applications to decidability problems in Petri nets (English)
    0 references
    0 references
    0 references
    1985
    0 references
    Various right-closed vector sets which are important for analyzing, constructing, or controlling Petri nets are studied. The minimal generating set of a right closed vector set (\(K=K+{\mathbb{N}}^ n)\) is finite and called the residue set of K:\(res(K).\) It is shown that for various sets, which are important for analysis of Petri nets (such as CONTINUAL(\^T), UNBOUNDED, or NOTBLOCKED(\^T)) one can effectively compute their respective residue sets. The new method for calculating the residue set not only solves a number of open problems but also gives a method for controlling a Petri net in order to realize its maximal live subbehaviour. This gives a new solution for the bankers problem described by Dijkstra.
    0 references
    right-closed vector sets
    0 references
    Petri nets
    0 references
    residue sets
    0 references
    maximal live subbehaviour
    0 references
    bankers problem
    0 references

    Identifiers