Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis (Q5025057): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(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: Petri net synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5216152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded choice-free Petri net synthesis: algorithmic issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Over-approximative Petri net synthesis for restricted subclasses of nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for the synthesis of bounded nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The synthesis problem for elementary net systems is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorisation of transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorisation of Petri net solvable transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Articulation of Transition Systems and Its Application to Petri Net Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The synthesis problem of Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining bridge-connected and biconnected components on-line / rank
 
Normal rank
Property / cites work
 
Property / cites work: The box algebra = Petri nets + process expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Property of Choice-Free Petri Net Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolating Quantifier-Free Presburger Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness Results for the Synthesis of b-bounded Petri Nets / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3208987153 / rank
 
Normal rank

Latest revision as of 09:31, 30 July 2024

scientific article; zbMATH DE number 7467839
Language Label Description Also known as
English
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
scientific article; zbMATH DE number 7467839

    Statements

    Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis (English)
    0 references
    0 references
    0 references
    1 February 2022
    0 references
    0 references
    labelled transition systems
    0 references
    composition
    0 references
    decomposition
    0 references
    Petri net synthesis
    0 references
    0 references
    0 references
    0 references
    0 references