Identification of Petri nets from knowledge of their language (Q2465425): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Inference of Reversible Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace nets and process automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The synthesis of Petri nets from path-automatic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control of systems integrating logic, dynamics, and constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic bottleneck problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: State estimation of \(\lambda\)-free labeled Petri nets with contact-free nondeterministic transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of automaton identification from given data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Synthesis of Petri Nets from Scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: System theory for system identification. / rank
 
Normal rank

Revision as of 13:40, 27 June 2024

scientific article
Language Label Description Also known as
English
Identification of Petri nets from knowledge of their language
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references