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

William Henderson

dblp:30/506 · DBLP profile ↗
← Back
9ranked-venue papers
5as first author
0since 2021 · last 2001
—ORCID · none

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

Systems, architecture and hardware · 3 · 2 first-authorComputer networks · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 3 · 1 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%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
queueing models		 0.021994
A convolution algorithm for calculating exact equilibrium distributions in resource allocation problems with moderate user interference · IEEE Trans. Commun. 1994
Embedded Processes in Stochastic Petri Nets · IEEE Trans. Software Eng. 1991
Performance modeling and evaluation › queueing models › product-form queueing networks
product-form equilibrium distribution		 0.011994
A convolution algorithm for calculating exact equilibrium distributions in resource allocation problems with moderate user interference · IEEE Trans. Commun. 1994
Algorithmic game theory and mechanism design
resource allocation		 0.011994
A convolution algorithm for calculating exact equilibrium distributions in resource allocation problems with moderate user interference · IEEE Trans. Commun. 1994
Performance modeling and evaluation
stochastic petri nets		 0.011991
Embedded Processes in Stochastic Petri Nets · IEEE Trans. Software Eng. 1991

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

convolution algorithm · 0.0embedded discrete time processes · 0.0aggregation procedure · 0.0
YearPublicationVenuePosition
2001 Improving the Accuracy of Scheduling Analysis Applied to Distributed Systems Computing Minimal Response Times and Reducing Jitter
William Henderson, David Kendall, Adrian Robson
 Real Time Syst.1
2001 A formal design language for real-time systems with data
Steven Bradley, William Henderson, David Kendall, Adrian Robson
 Sci. Comput. Program.2
1998 Integrating AORTA with Model-Based Data Specification Languages
Steven Bradley, William Henderson, David Kendall, Adrian Robson
 FASE2
1996 Product form Equilibrium Distributions and a Convolution Algorithm for Stochastic Petri Nets
J. L. Coleman, William Henderson, Peter G. Taylor
 Perform. Evaluation2
1994 A convolution algorithm for calculating exact equilibrium distributions in resource allocation problems with moderate user interference
abstract
A convolution algorithm, suitable for nonconvex regions, is derived and used to efficiently evaluate exact normalising constants for systems with product form equilibrium distributions and large state spaces. It is observed that this algorithm is much more efficient for certain systems than the standard convolution algorithms.>
J. L. Coleman, William Henderson, Peter G. Taylor
 IEEE Trans. Commun.2
1993 Finding and Using Exact Equilibrium Distributions for Stochastic Petri Nets
William Henderson
 Comput. Networks ISDN Syst.1
1993 Aggregation and Disaggregation Through Insensitivity in Stochastic Petri Nets
William Henderson, D. Lucic
 Perform. Evaluation1
1991 Embedded Processes in Stochastic Petri Nets
abstract
Embedded discrete time processes are used to study a class of SPNs (stochastic Petri nets) which have a closed-form equilibrium distribution. These SPNs have probabilistic output bags, colored tokens, and alternating periods of arbitrarily distributing enabling and firing times (periods of time between transitions becoming enabled and absorption of tokens and between transitions absorbing tokens and depositing them in output places, respectively). In addition, an aggregation procedure is proposed which, in certain nets, not only reduces a complex SPN to a much simpler skeleton SPN but also obtains results for the skeleton SPN with are exact marginal distributions for the original SPN.>
William Henderson, Peter G. Taylor
 IEEE Trans. Software Eng.1
1990 Performance Analysis: When Do We Give Up on Product Form Solutions
William Henderson
 Comput. Networks ISDN Syst.1