On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Synthesis and verification of discrete controllers for robotics and manufacturing devices with temporal logic and the control-D system
Journal of the ACM (JACM)
A Logic for Planning under Partial Observability
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
An Automata-Theoretic Approach to Fair Realizability and Synthesis
Proceedings of the 7th International Conference on Computer Aided Verification
A Scalable and Ontology-Based P2P Infrastructure for Semantic Web Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Run-Time Monitoring of Instances and Classes of Web Service Compositions
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Complexity and composition of synthesized web services
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computational Complexity of Web Service Composition Based on Behavioral Descriptions
ICTAI '08 Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
Type-Aware Web Service Composition Using Boolean Satisfiability Solver
CECANDEEE '08 Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services
Synthesizing service composition models on the basis of temporal business rules
Journal of Computer Science and Technology
On the partial observability of temporal uncertainty
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Observation reduction for strong plans
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A parametric hierarchical planner for experimenting abstraction techniques
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Automated composition of web services by planning at the knowledge level
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Strong planning under partial observability
Artificial Intelligence
Efficient abstraction and refinement for behavioral description based web service composition
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
HTN planning for Web Service composition using SHOP2
Web Semantics: Science, Services and Agents on the World Wide Web
Web Services: Concepts, Architectures and Applications
Web Services: Concepts, Architectures and Applications
On the computational complexity of behavioral description-based web service composition
Theoretical Computer Science
Hi-index | 0.00 |
The web service composition problem with respect to behavioural descriptions deals with the automatic synthesis of a coordinator web service that controls a set of web services to reach a goal state. Despite its importance, however, solving the problem for a general case when the coordinator has only partial observations remains doubly exponential in the number of variables in web service descriptions. Toward this challenge, we propose two novel signature preserving and subsuming approximation-based approaches using abstraction and refinement. Given a set of web service behavioural descriptions and a reachability goal, we automatically construct abstract web services which have less variables using over-approximation. If our method identifies a coordinator web service, the coordinator is guaranteed to control the given web services to reach the goal state no matter how they behave. Otherwise, our method refines the current abstraction by adding some variables that have strong dependency on the goal variables.