Came up with a test for the BPM system. Well, or fun for the BPM system. Why not calculate the factorial of 100 by recursive process in a BPM system? I suppose this is a good test of the core BPM system, whether the core will survive 100 nested process calls. And whether the result from the lowest 100th sub-process will return back to the 1st parent process.
From the Camunda promotional brochure:
Designed for performance: high throughput, cluster ready, and scalability with a very lightweight (<3MB) engine for executing BPMN workflow models.
Ok! Let's check the ads! )))
, Camunda, , BPM. CRM , .
CRM/BPM , . , , . , , .
CRM/BPM , 10 , 10, , .
, Camunda Modeler :
«Check Init» , , .
«Recursion Input» .
«Check End 1» , , .
«Call Self» , , .
«Check End 2» , , , .
«Recursion Output» .
, Text Script, .
20 :
To summarize: Camunda is cool! ))) I'm sure that very few BPM systems can withstand such a mockery of the core of the system.
PS: Unfortunately, I won't write more about Camunda, I switched to other topics.