On the computational complexity of behavioral description-based web service composition
DOI10.1016/J.TCS.2011.04.020zbMATH Open1228.68037OpenAlexW2132886830MaRDI QIDQ650907FDOQ650907
Authors: Wonhong Nam, Hyunyoung Kil, Dong Won Lee
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.020
Recommendations
- Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition
- Web services composition: complexity and models
- A Lower Bound on Web Services Composition
- A lower bound on web services composition
- A Petri net-based semantic Web service automatic composition method
Analysis of algorithms and problem complexity (68Q25) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Internet topics (68M11)
Cites Work
Cited In (7)
- A lower bound on web services composition
- A Lower Bound on Web Services Composition
- The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures
- A method to represent the semantic description of a web service based on complexity functions
- A cost-effective planning graph approach for large-scale Web Service Composition
- Web services composition: complexity and models
- On the aggregation problem for synthesized web services
Uses Software
This page was built for publication: On the computational complexity of behavioral description-based web service composition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650907)