Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Informatics

SOFSEM 2016: SOFSEM 2016: Theory and Practice of Computer Science pp 171–182Cite as

Using Attribute Grammars to Model Nested Workflows with Extra Constraints

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9587))

Abstract

Workflow is a formal description of a process. Nested workflows were proposed to model processes with a hierarchical structure and they support extra logical and temporal constraints to express relations beyond the hierarchical structure. This workflow model supports scheduling applications with a known number of activities in the process, but it cannot be used to model planning problems, where the number of activities is unknown beforehand. In this paper we propose to model nested workflows using a modified version of attribute grammars. In particular we show that nested workflows with extra constraints can be fully translated to attribute grammars. The major advantage of this novel modeling framework is a support for recursive tasks that can model planning problems in the style of hierarchical task networks.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

References

  1. Bae, J., Bae, H., Kang, S.-H., Kim, Z.: Automatic control of workflow processes using ECA rules. IEEE Trans. Knowl. Data Eng. 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., Rovenský, V.: On verification of nested workflows with extra constraints: from theory to practice. Expert Syst. Appl. 41(3), 904–918 (2014)

    Article  Google Scholar 

  5. Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

  6. Knuth, D.E.: Semantics of context-free languages. Math. Syst. Theory 2(2), 127–145 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  7. Nau, D.S., Au, T.-C., Ilghami, O., Kuter, U., Murdock, J.W., Wu, D., Yaman, F.: SHOP2: an HTN planning system. J. Artif. Intell. Res. (JAIR) 20, 379–404 (2003)

    MATH  Google Scholar 

  8. van der Aalst, W., ter Hofstede, A.H.M.: Yawl: yet another workflow language. Inf. Syst. 30(4), 245–275 (2005)

    Article  Google Scholar 

Download references

Acknowledgments

Research is supported by the Czech Science Foundation under the project P103-15-19877S.

Author information

Authors and Affiliations

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

    Roman Barták

Authors
  1. Roman Barták
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Roman Barták .

Editor information

Editors and Affiliations

  1. University of Latvia, Riga, Latvia

    Rūsiņš Mārtiņš Freivalds

  2. University of Paderborn, Paderborn, Germany

    Gregor Engels

  3. University of Genoa, Genoa, Italy

    Barbara Catania

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barták, R. (2016). Using Attribute Grammars to Model Nested Workflows with Extra Constraints. In: Freivalds, R., Engels, G., Catania, B. (eds) SOFSEM 2016: Theory and Practice of Computer Science. SOFSEM 2016. Lecture Notes in Computer Science(), vol 9587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49192-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49192-8_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49191-1

  • Online ISBN: 978-3-662-49192-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation