Complexity of synthesis of composite service with correctness guarantee

DOI10.1007/S11432-011-4460-ZzbMath1245.68025OpenAlexW1979890789MaRDI QIDQ439758

Tianyu Wo, Ting Deng, Jin-Peng Huai

Publication date: 17 August 2012

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-011-4460-z

zbMATH Keywords

synthesisenvironmentbranching temporal logicbusiness protocolcomposite service

Mathematics Subject Classification ID

Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12) Internet topics (68M11)

Uses Software

• WSAT
• AutoSyn

Cites Work

• Unnamed Item
• Unnamed Item
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee
• Using branching time temporal logic to synthesize synchronization skeletons
• Automata-theoretic techniques for modal logics of programs
• Propositional dynamic logic of regular programs
• Synthesis from Component Libraries
• Deciding full branching time logic
• A Deductive Approach to Program Synthesis
• The Complexity of Tree Automata and Logics of Programs
• Buy one, get one free!!!
• An automata-theoretic approach to branching-time model checking
• Automated Technology for Verification and Analysis

This page was built for publication: Complexity of synthesis of composite service with correctness guarantee