Parametrized automata simulation and application to service composition. (July 2015)

• Record Type: Journal Article
• Authors: Belkhir, Walid; Chevalier, Yannick; Rusinowitch, Michael
• Is Part Of: Journal of symbolic computation. Volume 69(2015)
• Page Start: 40
• Page End: 60
• Publication Date: 2015-07
• Subjects: Parametrized automata -- Service -- Simulation preorder -- Composition synthesis -- Infinite alphabet; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2014.09.029
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: The service composition problem asks whether, given a client and a community of available services, there exists an agent (called the mediator) that suitably delegates the actions requested by the client to the available community of services. We address this problem in a general setting where the agents communication actions are parametrized by data from an infinite domain and possibly subject to constraints. For this purpose, we define parametrized automata (PAs), where transitions are guarded by conjunction of equalities and disequalities. We solve the service composition problem by showing that the simulation preorder of PAs is decidable and devising a procedure to synthesize a mediator out of a simulation preorder. We also show that the Nonemptiness problem of PAs is PSPACE-complete.