Capturing the Probability Flow
Our automaton model belongs to the class of continuous-time hybrid-state automata with deterministic-timed and probabilistic passenger load-driven jumps among a finite set of discrete modes. In general, every mode in such a model refers to a discrete state to which is assigned to a continuous domain with a continuous differential dynamics 2 . An edge-labelled graph - here and in the following referred to as a mode graph (cf. Fig. 6.a below) - captures all jump conditions between the different modes that might have been defined in terms of the continuous states that have to enter particular target sets or time-thresholds that have to elapse.