Abstract
Web services coordination has become a central topic for further development of Internet-based distributed computing. One approach to this coordination task is supported by generative communication, and more specifically by some implementations of the Linda model as JavaSpaces. However, when applying these coordination strategies to real projects, some drawbacks appear. One of the main limitations is the lack of transactional queries. In this paper we deal with this problem extending the matching mechanism of the Linda model. Then, a variant of the well-known RETE algorithm can be devised in order to implement our extended Linda model efficiently. This also opens new research lines in which Artificial Intelligence techniques (as advanced blackboard architectures) could be applied to the field of web services coordination.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
