Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition (Q5166610): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.entcs.2009.06.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2100891401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games for synthesis of controllers with partial observation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: AUTOMATIC SERVICE COMPOSITION VIA SIMULATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: The variable hierarchy of the \(\mu\)-calculus is strict / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof methods for modal and intuitionistic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding true concurrency equivalences on safe, finite nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank

Latest revision as of 17:13, 8 July 2024

scientific article; zbMATH DE number 6309372
Language Label Description Also known as
English
Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition
scientific article; zbMATH DE number 6309372

    Statements

    Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition (English)
    0 references
    0 references
    0 references
    0 references
    27 June 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    service composition
    0 references
    controller synthesis
    0 references
    computational complexity
    0 references
    0 references