作者: Walid Belkhir , Yannick Chevalier , Michael Rusinowitch
DOI: 10.1007/978-3-319-22885-3_26
关键词: Existential quantification 、 Simulation preorder 、 Theoretical computer science 、 EXPTIME 、 Mathematics 、 Automaton 、 Conjunction (grammar) 、 Domain (software engineering) 、 Decidability 、 Service (business)
摘要: The service composition problem asks whether, given a client and community of available services, there exists an agent (called the mediator) that suitably delegates actions requested by to services. We address this in general setting where agents communication are parametrized data over infinite domain possibly subject constraints. For purpose, we define automata (PAs), transitions guarded conjunction equalities disequalities. solve showing simulation preorder PAs is decidable.