Complexity results for 1-safe nets (Q672459): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Advances in Petri nets 1992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial order behaviour and structure of Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marked directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking using net unfoldings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm to decide liveness of bounded free choice nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronisationsgraphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equality problem for vector addition systems is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness results for conflict-free vector replacement systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems concerning fairness and temporal logic for conflict-free Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding true concurrency equivalences on finite safe nets (preliminary report) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of some problems in Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Conflict-Free and Persistent Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the General Petri Net Reachability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3771629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776635 / rank
 
Normal rank

Latest revision as of 11:18, 27 May 2024

scientific article
Language Label Description Also known as
English
Complexity results for 1-safe nets
scientific article

    Statements

    Complexity results for 1-safe nets (English)
    0 references
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    0 references
    1-safe Petri nets
    0 references
    0 references