A Symbolic Algorithm for the Synthesis of Bounded Petri Nets (Q3510859): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial algorithms for the synthesis of bounded nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deriving Petri nets from finite transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The synthesis problem of Petri nets / 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: A trace semantics for Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An event structure semantics for general Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PETRI NETS AND STEP TRANSITION SYSTEMS / rank
 
Normal rank

Latest revision as of 12:07, 28 June 2024

scientific article
Language Label Description Also known as
English
A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
scientific article

    Statements

    Identifiers