Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Yao Li 0001

dblp:96/13-1 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1995
0000-0001-8720-883XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Performance modeling and evaluation · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › numerical algorithms
decomposition methods		 0.021995
Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks (Corrected Version) · IEEE Trans. Computers 1995
Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks · IEEE Trans. Computers 1995
Performance modeling and evaluation
stochastic petri nets		 0.021995
Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks (Corrected Version) · IEEE Trans. Computers 1995
Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks · IEEE Trans. Computers 1995

Methods — techniques the papers use, named apart from their topics

stochastic petri net analysis · 0.0decomposition · 0.0
YearPublicationVenuePosition
1995 Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks
abstract
Complete decomposition is a new strategy for evaluating the performance of a network of generalized service centers, represented in the notation of Generalized Stochastic Petri Net (GSPNs). Each service center can have arbitrary internal structure (including internal parallelism), but it must conserve tokens at the boundaries, and its inputs must be i/o-connected to its outputs. Routing between centers can depend on the state of the departure center. The new method adapts a delay equivalence decomposition technique used previously. Within this framework, it reduces the solution complexity of the auxiliary models which must be solved in the iteration. This new method is applied to a scalable model for computer system performance.>
Yao Li 0001, C. Murray Woodside
 IEEE Trans. Computers1
1995 Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks (Corrected Version)
abstract
Complete decomposition is a new strategy for evaluating the performance of a network of generalized service centers, represented in the notation of Generalized Stochastic Petri Nets (GSPNs). Each service center can have arbitrary internal structure (including internal parallelism), but it must conserve tokens at the boundaries, and its inputs must be i/o-connected to its outputs. Routing between centers can depend on the state of the departure center. The new method adapts a delay equivalence decomposition technique used previously. Within this framework, it reduces the solution complexity of the auxiliary models which must be solved in the iteration. This new method is applied to a scalable model for computer system performance.>
Yao Li 0001, C. Murray Woodside
 IEEE Trans. Computers1