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”

Verifying 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%2F13%3A10195066" target="_blank" >RIV/00216208:11320/13:10195066 - isvavai.cz</a>

  • Result on the web

    <a href="http://download.springer.com/static/pdf/412/chp%253A10.1007%252F978-3-642-37807-2_31.pdf?auth66=1393604911_f45ba675f7b77bb8e1b209b17d5955f8&ext=.pdf" target="_blank" >http://download.springer.com/static/pdf/412/chp%253A10.1007%252F978-3-642-37807-2_31.pdf?auth66=1393604911_f45ba675f7b77bb8e1b209b17d5955f8&ext=.pdf</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-642-37807-2_31" target="_blank" >10.1007/978-3-642-37807-2_31</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Verifying Nested Workflows with Extra Constraints

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP202%2F10%2F1188" target="_blank" >GAP202/10/1188: KnowSched: Knowledge Techniques in Scheduling</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2013

  • 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

    MICAI'12 Proceedings of the 11th Mexican international conference on Advances in Artificial Intelligence - Volume Part I

  • ISBN

    978-3-642-37806-5

  • ISSN

  • e-ISSN

  • Number of pages

    12

  • Pages from-to

    359-370

  • Publisher name

    Springer-Verlag

  • Place of publication

    Berlin, Heidelberg

  • Event location

    San Luis Potosí, Mexico

  • Event date

    Oct 27, 2012

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article