The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Peterson, J. L. (1977) · ACM Computing Surveys · doi:10.1145/356698.356702 · Cited by 1,179
Formal verification of parallel programs
Keller, R. M. (1976) · Communications of the ACM · doi:10.1145/360248.360251 · Cited by 797
Markov Chains -- Theory and Applications
Unwin, A., Isaacson, D. L., & Madsen, R. W. (1977) · Operational Research Quarterly (1970-1977) · doi:10.2307/3008804 · Cited by 478
A note on reliable full-duplex transmission over half-duplex links
Bartlett, K. A., Scantlebury, R. A., & Wilkinson, P. T. (1969) · Communications of the ACM · doi:10.1145/362946.362970 · Cited by 445
A Comparison of Some Theoretical Models of Parallel Computation
Miller, R. E. (1973) · IEEE Transactions on Computers · doi:10.1109/tc.1973.5009149 · Cited by 101
Specification and Validation of Protocols
Merlin, P. M. (1979) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1979.1094323 · Cited by 90
Cited by
Petri nets: Properties, analysis and applications
Murata, T. (1989) · Proceedings of the IEEE · doi:10.1109/5.24143 · Cited by 10,606
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
Stochastic Activity Networks: Formal Definitions and Concepts⋆
Sanders, W. H., & Meyer, J. F. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44667-2_9 · Cited by 334
The Mobius framework and its implementation
Deavours, D. D., Clark, G., Courtney, T., Daly, D., Derisavi, S., Doyle, J. M., Sanders, W. H., & Webster, P. G. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2002.1041052 · Cited by 275
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
- 6
- 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
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.