The Application of Ontologies to Reasoning with Process Modeling Formalisms

The Application of Ontologies to Reasoning with Process Modeling Formalisms Xing Tan Doctor of Philosophy Graduate Department of Mechanical and Industrial Engineering University of Toronto 2012 Reasoning about processes in applications such as manufacturing, web services, enterprise modeling, and planning requires the representation of composite processes with complicated flows of control. Previous research in process representation has used formalisms such as Event Systems, Petri nets, and the Unified Modeling Language activity diagrams. The computational hardness of temporal projection problems in Event Systems has been extensively examined in the literature, whereas Petri nets and UML activity diagrams are applied to describe more elaborate processes. This thesis takes a systematic look into the temporal reasoning problems in Event Systems and assigns accurate semantics to both Petri nets and, for the first time, to UML activity diagrams. We give an analysis of computational complexity in temporal projection problems by exploring the boundary between their tractable and intractable subproblems. Our results provide new insights into the prominent role the properties of partial ordering play, however we also show that partial ordering is not the sole source of the intractability as has been claimed in an earlier work by Nebel and Bäckström. Two influential modeling languages, Petri nets and UML activity diagrams, are axiomatized as two Basic Action Theories of Situation Calculus. They are called, respectively, SCOPE (Situation Calculus Ontology of PEtri nets) and SCAD (Situation Calculus theory of Activity Diagrams). We provide a Prolog implementation of SCOPE and prove the correctness of this program for regressable queries. We use SCAD to axiomatize the structural and dynamic properties

[1]  Vincent Conitzer,et al.  Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders , 2008, AAAI.

[2]  Xing Tan.  SCOPE: A Situation Calculus Ontology of Petri Nets , 2010, FOIS.

[3]  Kurt Jensen,et al.  Coloured Petri nets: A high level language for system design and analysis , 1991, Applications and Theory of Petri Nets.

[4]  Bernhard Nebel,et al.  On the Computational Complexity of Temporal Projection, Planning, and Plan Validation , 1994, Artif. Intell..

[5]  W. Trotter,et al.  Combinatorics and Partially Ordered Sets: Dimension Theory , 1992 .

[6]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[7]  Richard J. Mayer,et al.  Information Integration for Concurrent Engineering (IICE) IDEF3 Process Description Capture Method Report , 1992 .

[8]  Maria Fox,et al.  A Note on Chapman's Modal Truth Criterion , 1993, EPIA.

[9]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[10]  Austin Tate,et al.  Roots of SPAR — Shared Planning and Activity Representation , 1998, The Knowledge Engineering Review.

[11]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[12]  Fangzhen Lin,et al.  Situation Calculus , 2008, Handbook of Knowledge Representation.

[13]  Carsten Brennecke.  Practical Workflow for SAP: Effective Business Processes using SAP's WebFlow Engine , 2002 .

[14]  Ondrej Pangrác,et al.  On the complexity of paths avoiding forbidden pairs , 2009, Discret. Appl. Math..

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

[16]  Sanjiang Li.  A Layered Graph Representation for Complex Regions , 2010, KR.

[17]  Malte Helmert,et al.  Complexity results for standard benchmark domains in planning , 2003, Artif. Intell..

[18]  Mathias Weske,et al.  Business Process Management: Concepts, Languages, Architectures , 2007 .

[19]  Jon Holt,et al.  UML for Systems Engineering: Watching the wheels , 2004 .

[20]  Malte Helmert,et al.  New Complexity Results for Classical Planning Benchmarks , 2006, ICAPS.

[21]  Hector J. Levesque,et al.  GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..

[22]  Michael Gruninger.  Definability and Process Ontologies , 2009 .

[23]  Leon J. Osterweil,et al.  On Two Problems in the Generation of Program Test Paths , 1976, IEEE Transactions on Software Engineering.

[24]  Guy Juanole,et al.  Specification and verification of distributed systems using prolog interpreted petri nets. , 1984, ICSE '84.

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

[26]  Xing Tan,et al.  Towards tractable reasoning on temporal projection problems , 2009, 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems.

[27]  Helko Lehmann,et al.  Decidability Results for the Propositional Fluent Calculus , 2000, Computational Logic.

[28]  Raymond Reiter,et al.  Some contributions to the metatheory of the situation calculus , 1999, JACM.

[29]  Subbarao Kambhampati,et al.  On the Nature and Role of Modal Truth Criteria in Planning , 1996, Artif. Intell..

[30]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

[31]  Michael Grüninger,et al.  Towards Axiomatizing the Semantics of UML Activity Diagrams: A Situation-Calculus Perspective , 2010, 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[32]  Tim Ormsby,et al.  Getting to Know Arcgis Desktop: The Basics of ArcView, Arceditor, and Arcinfo , 2001 .

[33]  Daniel A. Marcus.  Graph Theory: A Problem Oriented Approach , 2008 .

[34]  Xing Tan,et al.  On the computational complexity of the reachability problem in UML activity diagrams , 2009, 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems.

[35]  Harald Störrle,et al.  Towards a Formal Semantics of UML 2.0 Activities , 2005, Software Engineering.

[36]  Vladan Devedzic,et al.  Reusing Petri Nets Through the Semantic Web , 2004, ESWS.

[37]  Rüdiger Valk,et al.  Petri Nets as Token Objects: An Introduction to Elementary Object Nets , 1998, ICATPN.

[38]  Sheila A. McIlraith,et al.  Analysis and simulation of Web services , 2003, Comput. Networks.

[39]  Michael Grüninger,et al.  Ontology of the Process Specification Language , 2004, Handbook on Ontologies.

[40]  Hananya Yinnone,et al.  On Paths Avoiding Forbidden Pairs of Vertices in a Graph , 1997, Discret. Appl. Math..

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

[42]  Ivan Futó,et al.  System Simulation and Cooperative Problem-solving on a Prolog Basis , 1984, Implementations of Prolog.

[43]  Michael Grüninger,et al.  Reasoning about Partially Ordered Web Service Activities in PSL , 2009, ASWC.

[44]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[45]  J. McCarthy.  Situations, Actions, and Causal Laws , 1963 .

[46]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[47]  Sara J. Graves,et al.  CASA and LEAD: adaptive cyberinfrastructure for real-time multiscale weather forecasting , 2006, Computer.

[48]  Kurt Jensen.  An Introduction to the Practical Use of Coloured Petri Nets , 1996, Petri Nets.

[49]  Erik Sandewall.  Features and fluents : representation of knowledge about dynamical systems , 1994 .

[50]  Jeffrey Scott Vitter,et al.  An efficient parallel algorithm for shortest paths in planar layered digraphs , 2005, Algorithmica.

[51]  Harald Störrle,et al.  Semantics of Control-Flow in UML 2.0 Activities , 2004, 2004 IEEE Symposium on Visual Languages - Human Centric Computing.

[52]  Jorge A. Baier,et al.  ConGolog, Sin Trans: Compiling ConGolog into Basic Action Theories for Planning and Beyond , 2008, KR.

[53]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[54]  Mark S. Boddy,et al.  Reasoning About Partially Ordered Events , 1988, Artificial Intelligence.

[55]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[56]  Yoav Shoham,et al.  Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .

[57]  V. S. Subrahmanian,et al.  When is Planning Decidable?**This work was supported in part by NSF Grant NSFD CDR-88003012 to the University of Maryland Systems Research Center, as well as NSF grants IRI-8907890 and IRI-9109755. , 1992 .

[58]  Dana Nau.  On the Complexity of Possible Truth , 1993 .

[59]  Yair Wand,et al.  Assigning Ontology-Based Semantics to Process Models: The Case of Petri Nets , 2008, CAiSE.

[60]  Andrea Domenici.  Petri nets in logic , 1990 .

[61]  The Process Specification Language: Theory and Applications , 2007 .

[62]  Franca Garzotto,et al.  On the Specification of Real-Time Systems Using Logic Programming , 1987, ESEC.

[63]  Michael Sipser,et al.  Introduction to the Theory of Computation , 1996, SIGA.

[64]  Michael Leuschel,et al.  Model checking object petri nets in prolog , 2004, PPDP '04.

[65]  Stefan Sarstedt.  Semantic foundation and tool support for model-driven development with UML 2 activity diagrams , 2006 .

[66]  Michael Grüninger,et al.  PSL: A semantic domain for flow models , 2005, Software & Systems Modeling.

[67]  Ingo Wegener,et al.  Complexity Theory , 2005 .

[68]  Adam Pease,et al.  IEEE standard upper ontology: a progress report , 2002, The Knowledge Engineering Review.

[69]  M. Fox,et al.  Enterprise Modeling , 1998, AI Mag..

[70]  Hector J. Levesque,et al.  Knowledge Representation and Reasoning , 2004 .

[71]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[72]  Michael Grüninger,et al.  The Process Specification Language (PSL) Theory and Applications , 2003, AI Mag..

[73]  Eugene L. Lawler,et al.  The Recognition of Series Parallel Digraphs , 1982, SIAM J. Comput..

[74]  Tim Weilkiens,et al.  Systems engineering with SysML / UML - modeling, analysis, design , 2007 .

[75]  Harald Störrle,et al.  Semantics and Verification of Data Flow in UML 2.0 Activities , 2005, VLFM.

[76]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..

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

[78]  Elvinia Riccobene,et al.  An ASM Semantics for UML Activity Diagrams , 2000, AMAST.

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