The DOI matches its Crossref record.
Performance Analysis Using Stochastic Petri Nets
Abstract
An isomorphism between the behavior of Petri nets with exponentially distributed transition rates and Markov processes is presented. In particular, k-bounded Petri nets are isomorphic to finite Markov processes and can be solved by standard techniques if k is not too large. As a practical example, we solve for the steady state average message delay and throughput on a communication link when the alternating bit protocol is used for error recovery.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
A logic for reasoning about time and reliability
Hansson, H., & Jonsson, B. (1994) · Formal Aspects of Computing · doi:10.1007/bf01211866 · Cited by 1,372
Kabir, S., & Papadopoulos, Y. (2019) · Safety Science · doi:10.1016/j.ssci.2019.02.009 · Cited by 389
Analytic Queueing Network Models for Parallel Processing of Task Systems
Thomasian, & Bay (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676712 · Cited by 104
Metadata
- Authors
- Molloy
- Venue
- IEEE Transactions on Computers
- Published
- 1982-09
- Volume
- C-31
- Issue
- 9
- Pages
- 913-917
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2125739093
- Cited by
- 1,071
- References
- 0
- FWCI
- 10.20
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Performance Analysis Using Stochastic Petri Nets. https://app.cochat.ai/papers/10.1109/tc.1982.1676110
- The paper
- Molloy. (1982). Performance Analysis Using Stochastic Petri Nets. IEEE Transactions on Computers. https://doi.org/10.1109/tc.1982.1676110
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
