BPMN-T: A Timed–Probabilistic Extension of BPMN with Formal Semantics
This program is tentative and subject to change.
Business Process Model and Notation (BPMN) is widely used for modelling and communicating workflows, yet it remains qualitative and lacks explicit semantics for timing, probability, and data syn- chronisation. This paper introduces BPMN-T, a timed–probabilistic extension of BPMN endowed with a formal operational semantics. BPMN-T enriches BPMN with temporal, probabilistic, and environ- ment annotations, whose semantics is defined as a Timed–Probabilistic Transition System (TPTS) unifying control-flow, timing, and sto- chastic behaviour. BPMN-T models can be transformed into Timed Automata, Markov Decision Processes, and Probabilistic Timed Au- tomata, thereby enabling comprehensive temporal and probabilistic verification. A verification and synchronisation framework further supports runtime deviation detection and adaptive alignment with real executions, realising verifiable and executable process digital twins.
This program is tentative and subject to change.
Mon 13 AprDisplayed time zone: Brasilia, Distrito Federal, Brazil change
14:00 - 15:30 | Session 5: Automated Reasoning, and Program AnalysisResearch Track / FormaliSE Program at Oceania VIII | ||
14:00 30mTalk | Profile-Guided Constraint Simplification for Symbolic Execution Research Track Roxana Shajarian University of Nebraska-Lincoln, Md Rashedul Hasan University of Nebraska-Lincoln, Lisong Xu University of Nebraska-Lincoln, USA, Hamid Bagheri University of Nebraska-Lincoln | ||
14:30 15mTalk | BPMN-T: A Timed–Probabilistic Extension of BPMN with Formal Semantics Research Track Ahang Zuo Univ. de Pau et des Pays de l’Adour | ||
14:45 15mTalk | Toward an automatic formal verification of Cairo v0 programs (Extended Abstract) Research Track | ||