On the computational complexity of behavioral description-based web service composition
From MaRDI portal
(Redirected from Publication:650907)
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
Cites work
- scientific article; zbMATH DE number 46423 (Why is no real title available?)
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- Alternation
- Relationships between nondeterministic and deterministic tape complexities
- The temporal semantics of concurrent programs
Cited in
(7)- A cost-effective planning graph approach for large-scale Web Service Composition
- A lower bound on web services composition
- A Lower Bound on Web Services Composition
- On the aggregation problem for synthesized web services
- 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
- Web services composition: complexity and models
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)