Charles Explorer logo
🇬🇧

On Complexity of Verifying Nested Workflows with Extra Constraints

Publication at Faculty of Mathematics and Physics |
2011

Abstract

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