Soundness for S - and A -Timed Workflow Nets Is Undecidable.
Ferucio Laurentiu TipleaGeanina Ionela MacoveiPublished in: IEEE Trans. Syst. Man Cybern. Part A (2009)
Keyphrases
- petri net
- sufficient conditions
- np complete
- workflow management systems
- data flow
- scientific workflows
- datalog programs
- workflow systems
- markov chain
- workflow management
- workflow models
- data sets
- colored petri nets
- dynamic systems
- service oriented
- business processes
- data management
- np hard
- search algorithm
- multi agent
- web services