PROBABILISTIC HYBRID AUTOMATA WITH VARIABLE STEP WIDTH APPLIED TO THE ANAYLSIS OF NETWORKED AUTOMATION SYSTEMS

Probabilistic Timed Automata (PTA) have successfully been applied to discuss problems specific to the field of Networked Automation Systems (NAS). This paper shows the transition from PTA towards Probabilistic Hybrid Automata (PHA) by introducing an event triggered variable time version of PTAs. The main idea is to increase accuracy and decrease state space of the underlying Discrete Time Markov Chains (DTMC) which are input for those probabilistic model checking algorithms for which these models should be used. For a better illustration of the advancement, the approach is applied to a typical example from the field of NAS.