A Lower Bound on Web Services Composition

DOI10.1007/978-3-540-71389-0_20zbMath1195.68067OpenAlexW1852748590MaRDI QIDQ5758040

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

complexityweb services compositionautomata simulation

Mathematics Subject Classification ID

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

Related Items (5)

Minimum-cost delegation in service composition ⋮ Controller/Orchestrator Synthesis via Filtration ⋮ On the aggregation problem for synthesized web services ⋮ Agent planning programs ⋮ Hardness of preorder checking for basic formalisms

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