Reachability in cyclic extended free-choice systems (Q685410): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Traps characterize home states in free choice systems / 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: Synchronisationsgraphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the General Petri Net Reachability Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:32, 22 May 2024

scientific article
Language Label Description Also known as
English
Reachability in cyclic extended free-choice systems
scientific article

    Statements

    Reachability in cyclic extended free-choice systems (English)
    0 references
    0 references
    0 references
    25 October 1993
    0 references
    0 references
    Petri nets
    0 references
    liveness
    0 references
    boundedness
    0 references
    cyclicity
    0 references