Minimum-cost delegation in service composition
From MaRDI portal
Publication:2378522
DOI10.1016/j.tcs.2008.08.040zbMath1171.68002OpenAlexW2139444219MaRDI QIDQ2378522
Oscar H. Ibarra, Jianwen Su, Cagdas E. Gerede, Bala Ravikumar
Publication date: 8 January 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.040
Related Items (2)
Minimum-cost delegation in service composition ⋮ Component simulation-based substitutivity managing QoS and composition issues
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of iterated shuffle
- Analysis and simulation of Web services.
- Minimum-cost delegation in service composition
- On composition and lookahead delegation of \(e\)-services modeled by automata
- Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services
- Analysis of Realizability Conditions for Web Service Choreographies
- Computer Aided Verification
- Counter machines and counter languages
- Algorithms and Computation
- A Lower Bound on Web Services Composition
This page was built for publication: Minimum-cost delegation in service composition