Simulation, verification and automated composition of web services

Web services -- Web-accessible programs and devices - are a key application area for the Semantic Web. With the proliferation of Web services and the evolution towards the Semantic Web comes the opportunity to automate various Web services tasks. Our objective is to enable markup and automated reasoning technology to describe, simulate, compose, test, and verify compositions of Web services. We take as our starting point the DAML-S DAML+OIL ontology for describing the capabilities of Web services. We define the semantics for a relevant subset of DAML-S in terms of a first-order logical language. With the semantics in hand, we encode our service descriptions in a Petri Net formalism and provide decision procedures for Web service simulation, verification and composition. We also provide an analysis of the complexity of these tasks under different restrictions to the DAML-S composite services we can describe. Finally, we present an implementation of our analysis techniques. This implementation takes as input a DAML-S description of a Web service, automatically generates a Petri Net and performs the desired analysis. Such a tool has broad applicability both as a back end to existing manual Web service composition tools, and as a stand-alone tool for Web service developers.

[1]  Henry Kautz,et al.  Blackbox: Unifying sat-based and graph-based planning , 1999, International Joint Conference on Artificial Intelligence.

[2]  James A. Hendler,et al.  Agents and the Semantic Web , 2001, IEEE Intell. Syst..

[3]  Alex M. Andrew,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2002 .

[4]  Vladik Kreinovich,et al.  Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness , 1999, IJCAI.

[5]  Jens Palsberg,et al.  Complexity Results for 1-safe Nets , 1993 .

[6]  Rodney R. Howell,et al.  Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets , 1989, Theor. Comput. Sci..

[7]  Tran Cao Son,et al.  Adapting Golog for Composition of Semantic Web Services , 2002, KR.

[8]  José Meseguer,et al.  Petri Nets Are Monoids , 1990, Inf. Comput..

[9]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[10]  James A. Hendler,et al.  The semantic Web and its languages , 2000 .

[11]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[12]  Juan M. Corchado,et al.  Agents for the web , 2004 .

[13]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[14]  David J. Goodman,et al.  Personal Communications , 1994, Mobile Communications.

[15]  Munindar P. Singh,et al.  Agents on the Web: The Agent Test , 1997, IEEE Internet Comput..

[16]  Jens Palsberg,et al.  Complexity Results for 1-safe Nets , 1993, FSTTCS.

[17]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[18]  Hector J. Levesque,et al.  ConGolog, a concurrent programming language based on the situation calculus , 2000, Artif. Intell..

[19]  Ian Horrocks,et al.  FAQs on OIL: the Ontology Inference Layer , 2000 .

[20]  James A. Hendler,et al.  The Semantic Web" in Scientific American , 2001 .

[21]  References , 1971 .

[22]  Wil M.P. van der Aalst,et al.  WOFLAN : a Petri-net-based workflow analyzer , 1999 .

[23]  Steve Wright,et al.  BizTalk Server: The Complete Reference with Cdrom , 2001 .

[24]  Craig Schlenoff,et al.  The Process Specification Language (PSL) Overview and Version 1.0 Specification , 2000 .

[25]  Glynn Winskel,et al.  Petri Nets, Algebras, Morphisms, and Compositionality , 1987, Inf. Comput..

[26]  Clarence A. Ellis,et al.  Modeling and Enactment of Workflow Systems , 1993, Application and Theory of Petri Nets.

[27]  Jerry R. Hobbs,et al.  DAML-S: Semantic Markup for Web Services , 2001, SWWS.

[28]  Z. Zdráhal,et al.  IBROW3 - An Intelligent Brokering Service for Knowledge-Component Reuse on the World Wide Web , 1998 .

[29]  Sheila A. McIlraith,et al.  Planning with complex actions , 2002, NMR.

[30]  Srinivas Narayanan,et al.  Reasoning About Actions in Narrative Understanding , 1999, IJCAI.

[31]  Jörg Desel,et al.  Shortest Paths in Reachability Graphs , 1993, J. Comput. Syst. Sci..

[32]  Tran Cao Son,et al.  Semantic Web Services , 2001, IEEE Intell. Syst..