Existence of home states in Petri nets is decidable (Q264201): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3268576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing systems in spite of distributed control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of Population Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Choice Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational sets in commutative monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semigroups, Presburger formulas, and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector Addition System Reversible Reachability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets with individual tokens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entscheidbarkeit bei Petri Netzen / rank
 
Normal rank

Latest revision as of 17:12, 11 July 2024

scientific article
Language Label Description Also known as
English
Existence of home states in Petri nets is decidable
scientific article

    Statements

    Existence of home states in Petri nets is decidable (English)
    0 references
    0 references
    0 references
    6 April 2016
    0 references
    concurrency
    0 references
    theory of computation
    0 references
    Petri nets
    0 references
    home states
    0 references

    Identifiers