On the aggregation problem for synthesized web services
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3586989 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- A Lower Bound on Web Services Composition
- A probabilistic approach to modeling and estimating the QoS of web-services-based workflows
- Conversation protocols: a formalism for specification and verification of reactive electronic services
- On the aggregation problem for synthesized web services
- Relational transducers for electronic commerce
- Specification and verification of data-driven Web applications
- Synthesis from Component Libraries
- Undecidable diophantine equations
- Verification of relational transducers for electronic commerce
Cited in
(2)
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)