Analiza możliwości formalnej weryfikacji problemów planowania w kontekście procesów biznesowych

• Autorzy: Radosław Klimek , Sebastian Ernst

Warianty tytułu

Formal Verification of Planning Problems in the Business Process Context. Analysis of Feasibility

• Języki publikacji: PL

Abstrakty

Artykuł nakreśla relacje między modelowaniem procesów biznesowych (BPM) oraz architektury zorientowanej na usługi (SOA) a metodami planowania (AI Planning), z uwzględnieniem aspektów takich jak modelowanie dziedzin problemów planowania za pomocą narzędzi modelowania procesów biznesowych czy automatycznej aranżacji usług w procesy za pomocą metod planowania. Nakreślono również nowy kierunek badawczy, związany z formalną weryfikacją dziedzin problemów planowania za pomocą wnioskowania dedukcyjnego, w oparciu o wzorce projektowe van der Aalsta i in. dla modeli biznesowych. Formalna weryfikacja realizowana jest z wykorzystaniem wnioskowania dedukcyjnego metodą tablic semantycznych. Własności modelu opisane są w logice temporalnej czasu liniowego. (abstrakt oryginalny)

EN

The paper presents the relations between business process modeling (BPM), service- oriented architecture (SOA) and AI planning methods, including such issues as planning problem domain modelling using business modelling tools or automatic service composition using planning methods. A new research direction, related to formal verification of planning domains using deductive reasoning, based on workflow patterns (van der Aalst et al.), is presented. Formal verification is implemented using deductive reasoning with semantic tables. The properties of the model are described using linear time temporal logic. (original abstract)

Słowa kluczowe

PL

Procesy biznesowe; Modelowanie procesów biznesowych; Architektura zorientowana na usługi SOA; Logika

EN

Business processes; Business Process Modeling; Serviced Oriented Architecture; Logic

• Czasopismo: Prace Naukowe Uniwersytetu Ekonomicznego we Wrocławiu. Informatyka Ekonomiczna
• Rocznik: 2011
• Tom: 22
• Numer: nr 212
• Strony: 169--183

Twórcy

autor

Radosław Klimek

• AGH Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie

autor

Sebastian Ernst

• AGH Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie

Bibliografia

• Alford R., Kuter U., Nau D. [2009], Translating HTNs to PDDL: A small amount of domain knowledge can go a long way, [in:] IJCAI'09, s. 1629-1634.
• Bäckström C. [1995], Expressive equivalence of planning formalisms, "Artificial Intelligence", 76(1-2), s. 17-34.
• Bae J., Bae H., Kang S.H., Kim Y. [2004], Automatic control of workflow processes using ECA rules, "IEEE Transactions on Knowledge and Data Engineering", 16(8), s. 1010-1023.
• Bonet B., Geffner H. [1999], Planning as Heuristic Search: New Results, [in:] ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning, vol. 46, s. 368-369.
• Bonet B., Geffner H. [2001], Planning as heuristic search, "Artificial Intelligence", 129(1-2), s. 5-33.
• Bylander T. [1994], The computational complexity of propositional STRIPS planning, "Artificial Intelligence", 69(1-2), s. 165-204.
• D'Agostino M., Gabbay D.M., H.R.P.J.e. [1999], Handbook of Tableau Methods, Kluwer Academic Publishers.
• Emerson E. [1990], Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, chapter Temporal and Modal Logic, Elsevier, MIT Press, s. 995-1072.
• Erol K., Hendler J., Nau D.S. [1994], HTN Planning: Complexity and Expressivity, [in:] AAAI-94, s. 1123-1128.
• Fikes R.E., Nilsson N.J. [1971], STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving, "Artificial Intelligence", 2(3-4), s. 189-208.
• Ghallab M., Nau D., Traverso P. [2004], Automated Planning: Theory & Practice, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.
• González-Ferrer A., Fernández-Olivares J., Castillo L. [2009], JABBAH: A Java Application Framework for the Translation Between Business Process Models and HTN, [in:] International Competition on Knowledge Engineering for Planning and Scheduling.
• González-Ferrer A., Fernández-Olivares J., Castillo L., Morales L. [2008], Towards the Use of XPDL as Planning and Scheduling Modeling Tool: the Workflow Patterns Approach, Advances in Artificial Intelligence-IBERAMIA 2008, s. 52-61.
• González-Ferrer A., Fernández-Olivares J., Castillo L. [2011], From Business Process Models to Hierarchical Task Network Planning Domains. Knowledge Engineering Review Accepted for publication in October 2010.
• Haslum P., Bonet B., Geffner H. [2005], New admissible heuristics for domain-independent planning, [in:] Proceedings of the National Conference on Artificial Intelligence, vol. 20, page 1163. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999.
• Helmert M., Domshlak C. [2009], Landmarks, critical paths and abstractions: What's the difference anyway, [in:] Proc. ICAPS, vol. 9.
• Keyder E., Bonet B. [2009], Tutorial: Heuristics for Planning, [in:] ICAPS 2009, vol. 129.
• Klimek R. [1999], Wprowadzenie do logiki temporalnej, Wydawnictwa Naukowo-Techniczne AGH, Kraków.
• Klimek R. [2012], Towards formal and deduction-based analysis of business models for soa processes, 4th International Conference on Agents and Artificial Intelligence, Vilamoura, Algrave, 6-8 February, 2012 [praca przyjęta].
• Lekavy M., Návrat P. [2007], Expressivity of STRIPS-like and HTN-like planning, "Agent and Multi- -Agent Systems: Technologies and Applications", s. 121-130.
• McDermott D., Ghallab M., Howe A., Knoblock C., Ram A., Valoso M., Weld D., Wilkins D. [1998], PDDL: The Planning Domain Definition Language, Version 1.2. Technical report, AIPS-98 Planning Compentition Committee.
• Myers K., Berry P. [1998], Workflow Management Systems: An AI Perspective. Technical report. Artificial Intelligence Center, SRI International, Menlo Park.
• OMG [2009], Business Process Modeling Notation Specification. Version 1.2.
• Richter S., Westphal M. [2010], The LAMA planner: Guiding cost-based anytime planning with landmarks, "Journal of Artificial Intelligence Research", 39, s. 127-177.
• Riehle D., Z.H. [1996], Understanding and using patterns in software development, "Theory and Practice of Object Systems", 2(1), s. 3-13.
• Russell S.J., Norvig P. [2010], Artificial Intelligence: A Modern Approach, Third Edition, Pearson Education, Upper Saddle River, New Jersey.
• Russell N., ter Hofstede A.H.M., v. d. A. W. M. N. [2006], Workflow control-flow patterns: A revised view. Technical report, BPM Center Report BPM-06-22, BPMcenter.org.
• Sandewall E., Rönnquist R. [1986], A Representation of Action Structures, [in:] AAAI-86. Department of Computer and Information Science, Linköping University.
• van der Aalst W.M.P., ter Hofstede A.H.M., K. B. B. A. [2003], Workflow patterns, "Distributed and Parallel Databases", 4(1), s. 5-51.
• WfMC (2008). XPDL 2.1 Complete Specification.
• White S.A. [2003], XPDL and BPMN, [in:] Workflow Handbook 2003, L. Fischer (ed).http://www.omg.org/bpmn/Documents/XPDL_BPMN.pdf.