Polynomial algorithms for the synthesis of bounded nets (Q5096743): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4431388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial (set) 2-structures. I: Basic notions and the representation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some complexity results on transition systems and elementary net systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trace semantics for Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank

Latest revision as of 21:42, 29 July 2024

scientific article; zbMATH DE number 7572976
Language Label Description Also known as
English
Polynomial algorithms for the synthesis of bounded nets
scientific article; zbMATH DE number 7572976

    Statements

    Identifiers