The Effect of Execution Policies on the Semantics and Analysis of Stochastic Petri Nets
IEEE Transactions on Software Engineering
Modeling and analysis of stochastic systems
Modeling and analysis of stochastic systems
Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Efficient Reachability Set Generation and Storage Using Decision Diagrams
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Analysis and Evaluation of Non-Markovian Stochastic Petri Nets
TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Markov regenerative SPN with non-overlapping activity cycles
IPDS '95 Proceedings of the International Computer Performance and Dependability Symposium on Computer Performance and Dependability Symposium
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Evaluating wireless sensor node longevity through Markovian techniques
Computer Networks: The International Journal of Computer and Telecommunications Networking
Software rejuvenation in the cloud
Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques
Non-markovian analysis for model driven engineering of real-time software
Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering
Investigating mobile crowdsensing application performance
Proceedings of the third ACM international symposium on Design and analysis of intelligent vehicular networks and applications
| Hi-index | 0.00 |
Among the proposed techniques for the analysis of non-Markovian models the state space expansion approach showed great flexibility in terms of modelling capacities. The principal drawback is the explosion of the state space. An attempt to alleviate such problem has been made in [1] but the storing of the reachability graph of the untimed system, augmented with information about active but not enabled events, still remains a bottleneck. This paper suggests a method for storing such an augmented reachability graph by the use of a Multi-terminal Multi-valued Decision Diagram and few Kronecker matrices. All the needed information is collected by applying a Saturation based algorithm that represents the main contribution of the work. An estimation of the memory occupation is also reported.