On the aggregation problem for synthesized web services
DOI10.1016/J.JCSS.2013.01.007zbMATH Open1408.68029OpenAlexW2165210114WikidataQ57495363 ScholiaQ57495363MaRDI QIDQ389232FDOQ389232
Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu
Publication date: 20 January 2014
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2013.01.007
Recommendations
- Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition
- Synthesis of relational web services
- Web services composition: complexity and models
- Reliability-aware automatic composition approach for web services
- On the computational complexity of behavioral description-based web service composition
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Internet topics (68M11)
Cites Work
- Title not available (Why is that?)
- Verification of relational transducers for electronic commerce
- Relational transducers for electronic commerce
- Title not available (Why is that?)
- Specification and verification of data-driven Web applications
- Title not available (Why is that?)
- Synthesis from Component Libraries
- A probabilistic approach to modeling and estimating the QoS of web-services-based workflows
- Undecidable diophantine equations
- On the aggregation problem for synthesized web services
- A Lower Bound on Web Services Composition
- Conversation protocols: a formalism for specification and verification of reactive electronic services
Cited In (1)
Uses Software
This page was built for publication: On the aggregation problem for synthesized web services
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389232)
