Formal verification of time-bounded BPMN model with message broker using timed automata

Key Points

• This work demonstrates the effectiveness of timed automata in verifying BPMN models, ensuring that they meet timing constraints.
• Key findings reveal that the model checking process successfully validated time-bounded properties under specific conditions.
• Formal verification was conducted using timed automata to assess the interaction between the BPMN model and the message broker.
• This analysis sheds light on potential gaps in BPMN implementations, highlighting necessary considerations for real-time systems.