The computational complexity of QoS measures for orchestrations
Open Access
- 24 June 2017
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 34 (4) , 1265-1301
Abstract
No abstract availableKeywords
Funding Information
- AGAUR (SGR 2014:1034, SGR 2014:1034)
- MINECO (TIN2013-46181-C2-1-R, TIN2013-46181-C2-1-R)
This publication has 18 references indexed in Scilit:
- The Robustness of Periodic Orchestrations in Uncertain Evolving Environments2015
- Towards verification of computation orchestrationFormal Aspects of Computing, 2014
- Analysing Web-Orchestrations Under Stress Using Uncertainty ProfilesThe Computer Journal, 2013
- Understanding latency variations of black box services2013
- Predictive Web Service Monitoring using Probabilistic Model CheckingApplied Mathematics & Information Sciences, 2013
- A Statistically Customisable Web Benchmarking ToolElectronic Notes in Theoretical Computer Science, 2009
- Probabilistic Delay Time Analysis in Networked Automation Systems2006
- A Language for Task Orchestration and Its Semantic Properties2006
- A Tree Semantics of an Orchestration Language2005
- Quality of service for workflows and web service processesJournal of Web Semantics, 2004