ACM Transactions on Computer Systems (TOCS)
On time and space decomposition of complex structures
Communications of the ACM
Hybrid reliability modeling of fault-tolerant computer systems
Computers and Electrical Engineering - Special issue: reliability and verification of computing systems
An Aggregation Technique for the Transient Analysis of Stiff Markov Chains
IEEE Transactions on Computers
Performance models of multiprocessor systems
Performance models of multiprocessor systems
ACM Computing Surveys (CSUR)
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Analysis of the Generalized Stochastic Petri Nets by State Aggregation
International Workshop on Timed Petri Nets
A Stochastic Petri Net Model for Ethernet
International Workshop on Timed Petri Nets
Timed and Stochastic Petri Nets: From the Validation to the Performance of Synchronization Schemes
International Workshop on Timed Petri Nets
Generalized Stochastic Petri Nets Revisitied: Random Switches and Priorities
PNPM '87 The Proceedings of the Second International Workshop on Petri Nets and Performance Models
Stochastic Activity Networks: Structure, Behavior, and Application
International Workshop on Timed Petri Nets
On the integration of delay and throughput measures in distributed processing models
On the integration of delay and throughput measures in distributed processing models
Performability Analysis of Distributed Real-Time Systems
IEEE Transactions on Computers
Time warp simulation using time scale decomposition
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Exact Parametric Analysis of Stochastic Petri Nets
IEEE Transactions on Computers
Introducation to stochastic Petri nets
Lectures on formal methods and performance analysis
Exploiting structure in solution: decomposing compositional models
Lectures on formal methods and performance analysis
Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks
IEEE Transactions on Computers
Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks
IEEE Transactions on Computers
Approximate Throughput Computation of Stochastic Marked Graphs
IEEE Transactions on Software Engineering
A simplified framework for stochastic workflow networks
Computers & Mathematics with Applications
| Hi-index | 0.02 |
A time-scale decomposition (TSD) algorithm of a class of generalized stochastic Petri net (GSPN) models of systems comprising activities whose duration differ by orders of magnitude is presented. The GSPN model of a system can be decomposed into a hierarchical sequence of aggregated subnets, each of which is valid at a certain time scale. These smaller subnets are solved in isolation and their solutions are combined to get the solution of the whole system. A degradable multiprocessor system which would be intractable using conventional techniques, is analyzed using TSD. The complexity of the TSD algorithm can be orders of magnitude smaller without any significant loss in the accuracy of the result. In general, the error due to aggregation is proportional to the maximum degree of coupling between aggregates. An expression of the error due to aggregation is also given in terms of the ratio of fast and slow transitions in the GSPN model. The algorithm is easy to use and can be easily automated.