The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures

DOI10.1007/S10878-017-0146-9zbMath1376.68015OpenAlexW2664291932MaRDI QIDQ1679522

Sergio Leon-Gaixas, Joaquim Gabarró, Maria J. Serna

Publication date: 9 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0146-9

zbMATH Keywords

computational complexitysemantic modelsorchestrationfirst response delayfully defined variables modelnumber of outputsQoS measures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Internet topics (68M11)

Related Items (1)

Modelling web-service uncertainty: the angel/daemon approach

Cites Work

• Unnamed Item
• Unnamed Item
• Reasoning about orchestrations of web services using partial correctness
• Towards verification of computation orchestration
• Coordination models and languages. 10th international conference, COORDINATION 2008, Oslo, Norway, June 4--6, 2008. Proceedings
• A timed semantics of Orc
• The Robustness of Periodic Orchestrations in Uncertain Evolving Environments
• The Complexity of Enumeration and Reliability Problems
• Abstraction, Refinement and Proof for Probabilistic Systems
• A Language for Task Orchestration and Its Semantic Properties

This page was built for publication: The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures