The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures
From MaRDI portal
(Redirected from Publication:1679522)
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
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 719756 (Why is no real title available?)
- A Language for Task Orchestration and Its Semantic Properties
- A timed semantics of Orc
- Abstraction, Refinement and Proof for Probabilistic Systems
- Coordination models and languages. 10th international conference, COORDINATION 2008, Oslo, Norway, June 4--6, 2008. Proceedings
- Reasoning about orchestrations of web services using partial correctness
- The Complexity of Enumeration and Reliability Problems
- The robustness of periodic orchestrations in uncertain evolving environments
- Towards verification of computation orchestration
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)