Complexity of synthesis of composite service with correctness guarantee (Q439758): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q592473
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jin-Peng Huai / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AutoSyn / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: WSAT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979890789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deductive Approach to Program Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using branching time temporal logic to synthesize synchronization skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4205072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Technology for Verification and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis from Component Libraries / rank
 
Normal rank
Property / cites work
 
Property / cites work: AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automata-theoretic approach to branching-time model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buy one, get one free!!! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata-theoretic techniques for modal logics of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding full branching time logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Tree Automata and Logics of Programs / rank
 
Normal rank

Latest revision as of 14:19, 5 July 2024

scientific article
Language Label Description Also known as
English
Complexity of synthesis of composite service with correctness guarantee
scientific article

    Statements

    Complexity of synthesis of composite service with correctness guarantee (English)
    0 references
    0 references
    0 references
    0 references
    17 August 2012
    0 references
    business protocol
    0 references
    composite service
    0 references
    synthesis
    0 references
    environment
    0 references
    branching temporal logic
    0 references
    0 references
    0 references

    Identifiers

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