The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures
DOI10.1007/S10878-017-0146-9zbMATH Open1376.68015OpenAlexW2664291932MaRDI QIDQ1679522FDOQ1679522
Authors: Sergio Leon-Gaixas, Joaquim Gabarró, Maria 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
Recommendations
- Web services composition: complexity and models
- QoS-aware management of monotonic service orchestrations
- Monotonicity in Service Orchestrations
- On the computational complexity of behavioral description-based web service composition
- Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition
computational complexitysemantic modelsorchestrationfirst response delayfully defined variables modelnumber of outputsQoS measures
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Internet topics (68M11)
Cites Work
- Title not available (Why is that?)
- The Complexity of Enumeration and Reliability Problems
- Title not available (Why is that?)
- Abstraction, Refinement and Proof for Probabilistic Systems
- A timed semantics of Orc
- Coordination models and languages. 10th international conference, COORDINATION 2008, Oslo, Norway, June 4--6, 2008. Proceedings
- A Language for Task Orchestration and Its Semantic Properties
- Reasoning about orchestrations of web services using partial correctness
- Towards verification of computation orchestration
- The robustness of periodic orchestrations in uncertain evolving environments
Cited In (5)
This page was built for publication: The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679522)
