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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00236-015-0227-0 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T37 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68P05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6560543 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00236-015-0227-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012801949 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1007/S00236-015-0227-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:48, 9 December 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