Efficient execution of dynamically controllable simple temporal networks with uncertainty (Q262129): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Dynamic controllability via timed game automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3112642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handling contingency in temporal constraint networks: from consistency to controllabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient execution of dynamically controllable simple temporal networks with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Controllability and Dispatchability Relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: CTP: A new constraint-based formalism for conditional, temporal planning / rank
 
Normal rank

Revision as of 16:04, 11 July 2024

scientific article
Language Label Description Also known as
English
Efficient execution of dynamically controllable simple temporal networks with uncertainty
scientific article

    Statements

    Identifiers

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