On the computational complexity of behavioral description-based web service composition

DOI10.1016/J.TCS.2011.04.020zbMATH Open1228.68037OpenAlexW2132886830MaRDI QIDQ650907FDOQ650907

Dong Won Lee, Wonhong Nam, Hyunyoung Kil

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

zbMATH Keywords

computational complexityincomplete informationweb service compositionbehavioral description

Mathematics Subject Classification ID

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

• Relationships between nondeterministic and deterministic tape complexities
• Title not available (Why is that?)
• The temporal semantics of concurrent programs
• Alternation
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• A lower bound on web services composition

Uses Software

• WSAT

   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 👍 👎

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)