Skip to main content
SpringerLink
Log in

Verifying Nested Workflows with Extra Constraints

  • Conference paper
Advances in Artificial Intelligence (MICAI 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7629))

Included in the following conference series:

  • 2198 Accesses

Abstract

Nested workflows are used to formally describe processes with a hierarchical structure similar to hierarchical task networks in planning. The nested structure guarantees that the workflow is sound in terms of possibility to select for each involved activity a process that contains the activity. However, if extra synchronization, precedence, or causal constraints are added to the nested structure, the problem of selecting a process containing a given activity becomes NP-complete. This paper presents techniques for verifying such workflows; in particular, they verify that a process exists for each activity.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bae, J., Bae, H., Kang, S.-H., Kim, Y.: Automatic Control of Workflow Processes Using ECA Rules. IEEE Transactions on Knowledge and Data Engineering 16(8), 1010–1023 (2004)

    Article  Google Scholar 

  2. Barták, R., Čepek, O.: Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. In: Dochev, D., Pistore, M., Traverso, P. (eds.) AIMSA 2008. LNCS (LNAI), vol. 5253, pp. 235–246. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Barták, R., Cully, M., Jaška, M., Novák, L., Rovenský, V., Sheahan, C., Skalický, T., Thanh-Tung, D.: Workflow Optimization with FlowOpt, On Modelling, Optimizing, Visualizing, and Analysing Production Workflows. In: Proceedings of Conference on Technologies and Applications of Artificial Intelligence (TAAI 2011), pp. 167–172. IEEE Conference Publishing Services (2011)

    Google Scholar 

  4. Barták, R.: On Complexity of Verifying Nested Workflows with Extra Constraints. In: Proceedings of 4th International Conference on Agents and Artificial Intelligence (ICAART 2012), vol. 1, pp. 346–354. SciTePress (2012)

    Google Scholar 

  5. Beck, J.C., Fox, M.S.: Constraint-directed techniques for scheduling alternative activities. Artificial Intelligence 121, 211–250 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bi, H.H., Zha, J.L.: Applying Propositional Logic to Workflow Verification. Information Technology and Management 5(3-4), 293–318 (2004)

    Article  Google Scholar 

  7. Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)

    Google Scholar 

  8. Dechter, R., Meiri, I., Pearl, J.: Temporal Constraint Networks. Artificial Intelligence 49, 61–95 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  9. Giro, S.: Workflow Verification: A New Tower of Babel. In: AIS-CMS International Modeling and Simulation Multiconference, Buenos Aires, Argentina (2007)

    Google Scholar 

  10. Kim, P., Williams, B., Abramson, M.: Executing Reactive, Model-based Programs through Graph-based Temporal Planning. In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 487–493 (2001)

    Google Scholar 

  11. Kuster, J., Jannach, D., Friedrich, G.: Handling Alternative Activities in Resource-Constrained Project Scheduling Problems. In: Proceedings of Twentieth International Joint Conference on Artificial Intelligence (IJCAI), pp. 1960–1965 (2007)

    Google Scholar 

  12. Planken, L.R.: New Algorithms for the Simple Temporal Problem. Master Thesis, Delft University of Technology (2008)

    Google Scholar 

  13. Sadiq, W., Orlowska, M.E.: Analyzing Process Models using Graph Reduction Techniques. Information Systems 25(2), 117–134 (2000)

    Article  Google Scholar 

  14. van der Aalst, W., ter Hofstede, A.H.M.: Verification of Workflow Task Structures: A Petri-Net-Based Approach. Information Systems 25(1), 43–69 (2000)

    Article  MATH  Google Scholar 

  15. van der Aalst, W., ter Hofstede, A.H.M.: Yawl: Yet another workflow language. Information Systems 30(4), 245–275 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Charles University in Prague, Malostranské náměstí 25, 118 00, Praha 1, Czech Republic

    Roman Barták & Vladimír Rovenský

Authors
  1. Roman Barták
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimír Rovenský
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Eje Central Lazaro Cardenas Norte, Mexican Petroleum Institute, 152, Col. San Bartolo Atepehuacan, CP 07730, México D.F., Mexico

    Ildar Batyrshin

  2. Tecnológico de Monterrey, Campus Estado de México, Carretera Lago de Guadalupe Km 3.5, Atizapán de Zaragoza, ,,, CP 52926, Estado de México, Mexico

    Miguel González Mendoza

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barták, R., Rovenský, V. (2013). Verifying Nested Workflows with Extra Constraints. In: Batyrshin, I., González Mendoza, M. (eds) Advances in Artificial Intelligence. MICAI 2012. Lecture Notes in Computer Science(), vol 7629. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37807-2_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37807-2_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37806-5

  • Online ISBN: 978-3-642-37807-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation