Charles Explorer logo
🇨🇿

On Complexity of Verifying Nested Workflows with Extra Constraints

Publikace na Matematicko-fyzikální fakulta |
2011

Tento text není v aktuálním jazyce dostupný. Zobrazuje se verze "en".Abstrakt

The paper shows a theoretical complexity of the problem of verifying nested workflows with additional precedence, synchronization, and logical constraints.