A lower bound on web services composition

DOI10.2168/LMCS-4(2:5)2008MaRDI QIDQ3518281zbMATH OpenFDO

Authors Anca Muscholl, Igor Walukiewicz

Publication date 7 August 2008

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/LMCS-4(2:5)2008

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• A Lower Bound on Web Services Composition
• Web services composition: complexity and models
• On the computational complexity of behavioral description-based web service composition

Cited in

(7)

• Minimum-cost delegation in service composition
• AUTOMATIC SERVICE COMPOSITION VIA SIMULATION
• Reliability-aware automatic composition approach for web services
• Composition of web services using the product of automata
• A Lower Bound on Web Services Composition
• On the computational complexity of behavioral description-based web service composition
• EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system

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 Q3518281)