Reconfigurable timed graphs for the design of optimal scheduling in uncertain environments based on transition-timed Petri net (Q6053940): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejcon.2023.100831 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejcon.2023.100831 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4379802728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3602751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximated timed reachability graphs for the robust control of discrete event systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets for modeling of dynamic systems -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverability of Communication Protocols--Implications of a Theoretical Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive scheduling in a dynamic and stochastic FMS environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Modeling and Analysis of Timed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking of time Petri nets using the state class timed automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Estimation and Fault Diagnosis of Labeled Time Petri Net Systems With Unobservable Transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Clustering Approach to Approximate the Timed Reachability Graph for a Class of Time Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the flexible job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Scheduling Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Petri net based approach for multi-robot path planning / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJCON.2023.100831 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:00, 30 December 2024

scientific article; zbMATH DE number 7742776
Language Label Description Also known as
English
Reconfigurable timed graphs for the design of optimal scheduling in uncertain environments based on transition-timed Petri net
scientific article; zbMATH DE number 7742776

    Statements

    Reconfigurable timed graphs for the design of optimal scheduling in uncertain environments based on transition-timed Petri net (English)
    0 references
    0 references
    0 references
    27 September 2023
    0 references
    discrete event systems
    0 references
    timed Petri nets
    0 references
    stochastic Petri nets
    0 references
    timed reachability graphs
    0 references
    scheduling problems
    0 references

    Identifiers

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