Analysing nets by the invariant method
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Modeling the software architecture of a prototype parallel machine
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Time Scale Decomposition of a Class of Generalized Stochastic Petri Net Models
IEEE Transactions on Software Engineering
Numerical Analysis of Superposed GSPNs
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Fast and simple decomposition techniques for the reliability analysis of interconnection networks
Journal of Systems and Software
Response time densities in generalised stochastic petri net models
WOSP '02 Proceedings of the 3rd international workshop on Software and performance
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
Iterative Decomposition and Aggregation of Stochastic Marked Graph Petri Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
A structure based decomposition approach for GSPN
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Numerical analysis of stochastic marked graph nets
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
On State Space Decomposition for the Numerical Analysis of Stochastic Petri Nets
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Implicit Places in Net Systems
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
A Divide and Conquer Approach for the Performance Evaluation of Large Stochastic Petri Nets
PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
Adaptive decomposition and approximation for the analysis of stochastic petri nets
Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
A new petri net modeling technique for the performance analysis of discrete event dynamic systems
Journal of Systems and Software
A new disk-based technique for solving the largeness problem of stochastic modeling formalisms
Journal of Systems and Software
Queueing Networks and Markov Chains
Queueing Networks and Markov Chains
Performance analysis of multistage interconnection networks with a new high-level net model
Journal of Systems Architecture: the EUROMICRO Journal
Structured analysis techniques for large Markov chains
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
Hi-index | 0.24 |
Performance evaluation is required at every stage in the life cycle of a network protocol. Analytical modeling is the method of choice for fast and cost effective evaluation of a network protocol. One of the most efficient high-level formalisms used for analytical modeling of network protocols is stochastic petri nets (SPN's). Yet, complexity of nowadays network protocols, which results in the state space explosion of the underlying Markov chain (MC) model, has hindered the wide use of SPN's in the analysis of these protocols. Decomposition techniques are considered one of the main methodologies used for the approximate solution of the state explosion problem. Unfortunately, most of these techniques either require special form of the model or give insufficient accuracy of the solution. Moreover, small rates of communication protocols have caused additional overhead on any proposed technique for approximate evaluation of these protocols. This paper presents a new decomposition technique called behavior and delay equivalent block (BDEB) technique. This technique overcomes most of drawbacks of other techniques proposed in the literature. It introduces a new aggregation method that depends on using a new type of transitions called intelligent transition. The proposed technique adopts the delay equivalent criteria but in a new philosophy different from other techniques using the same criteria. The new technique is explained by applying it to an illustrative example and a scalable model of a courier protocol.