A Lower Bound on Web Services Composition

DOI10.1007/978-3-540-71389-0_20MaRDI QIDQ5758040zbMATH OpenOpenAlexFDO

Authors Anca Muscholl, Igor Walukiewicz

Publication date 7 September 2007

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71389-0_20

zbMATH Keywords

automata simulationcomplexityweb services composition

Mathematics Subject Classification ID

Internet topics (68M11) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A lower bound on web services composition
• Composition of web services using the product of automata
• On the computational complexity of behavioral description-based web service composition
• Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition
• Web services composition: complexity and models

Cited in

(8)

• Minimum-cost delegation in service composition
• Controller/orchestrator synthesis via filtration
• A lower bound on web services composition
• On the aggregation problem for synthesized web services
• Composition of web services using the product of automata
• On the computational complexity of behavioral description-based web service composition
• Hardness of preorder checking for basic formalisms
• Agent planning programs

This page was built for publication: A Lower Bound on Web Services Composition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758040)