Q5019696 (Q5019696): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: APT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2009.08871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process Mining / 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: Petri net synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributing finite automata through Petri net synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace nets and process automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3771633 / 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: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of Petri net methods for controlled discrete event systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flip-flop nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness Results for the Synthesis of b-bounded Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and applications of models of computation. 16th international conference, TAMC 2020, Changsha, China, October 18--20, 2020. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Boolean state separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary net synthesis remains NP-complete even for extremely simple inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relabelling LTS for Petri net synthesis via solving separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presynthesis of bounded choice-free or fork-attribution nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition systems of Elementary Net Systems with inhibitor arcs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:06, 4 December 2024

scientific article; zbMATH DE number 7454922
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7454922

    Statements

    0 references
    0 references
    10 January 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references