All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Using Attribute Grammars to Model Nested Workflows with Extra Constraints

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F16%3A10332072" target="_blank" >RIV/00216208:11320/16:10332072 - isvavai.cz</a>

  • Result on the web

    <a href="http://link.springer.com/chapter/10.1007%2F978-3-662-49192-8_14" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-662-49192-8_14</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-662-49192-8_14" target="_blank" >10.1007/978-3-662-49192-8_14</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Using Attribute Grammars to Model Nested Workflows with Extra Constraints

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA15-19877S" target="_blank" >GA15-19877S: Automated Knowledge and Plan Modeling for Autonomous Robots</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2016

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    SOFSEM 2016: Theory and Practice of Computer Science - 42nd International Conference on Current Trends in Theory and Practice of Computer Science. Proceedings.

  • ISBN

    978-3-662-49191-1

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    12

  • Pages from-to

    171-182

  • Publisher name

    Springer Verlag

  • Place of publication

    Berlin

  • Event location

    Harachov

  • Event date

    Jan 23, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article