A framework for simulation and symbolic state space analysis of non-markovian models
SAFECOMP'11 Proceedings of the 30th international conference on Computer safety, reliability, and security
Performance evaluation of schedulers in a probabilistic setting
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Transient analysis of non-Markovian models using stochastic state classes
Performance Evaluation
Region-Based analysis of hybrid petri nets with a single general one-shot transition
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Non-markovian analysis for model driven engineering of real-time software
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
Transient analysis of networks of stochastic timed automata using stochastic state classes
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
| Hi-index | 0.00 |
In the verification of reactive systems with nondeterministic densely valued temporal parameters, the state-space can be covered through equivalence classes, each composed of a discrete logical location and a dense variety of clock valuations encoded as a Difference Bounds Matrix (DBM). The reachability relation among such classes enables qualitative verification of properties pertaining events ordering and stimulus/response deadlines, but it does not provide any measure of probability for feasible behaviors. We extend DBM equivalence classes with a density-function which provides a measure for the probability of individual states. To this end, we extend Time Petri Nets by associating a probability density-function to the static firing interval of each nondeterministic transition. We then explain how this stochastic information induces a probability distribution for the states contained within a DBM class and how this probability evolves in the enumeration of the reachability relation among classes. This enables the construction of a stochastic transition system which supports correctness verification based on the theory of TPNs, provides a measure of probability for each feasible run, enables steady-state analysis based on Markov Renewal Theory. In so doing, we provide a means to identify feasible behaviors and to associate them with a measure of probability in models with multiple concurrent generally distributed nondeterministic timers.