Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
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
Automatic verification of finite-state concurrent systems using temporal logic specifications
Clarke, E. M., Emerson, E. A., & Sistla, A. P. (1986) · ACM Transactions on Programming Languages and Systems · doi:10.1145/5397.5399 · Cited by 3,605
Sequential Tests of Statistical Hypotheses
Wald, A. (1945) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731118 · Cited by 1,671
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
Sequential Tests of Statistical Hypotheses
Wald, A. (1992) · Springer Series in Statistics · doi:10.1007/978-1-4612-0919-5_18 · Cited by 1,345
Iosifescu, M., & Howard, R. A. (1972) · International Statistical Review · doi:10.2307/1402771 · Cited by 897
Model-checking for real-time systems
Alur, R., Courcoubetis, C., & Dill, D. (2002) · [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science · doi:10.1109/lics.1990.113766 · Cited by 897
Model-checking continuous-time Markov chains
Aziz, A., Sanwal, K., Singhal, V., & Brayton, R. (2000) · ACM Transactions on Computational Logic · doi:10.1145/343369.343402 · Cited by 419
Verifying continuous time Markov chains
Aziz, A., Sanwal, K., Singhal, V., & Brayton, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61474-5_75 · Cited by 344
Model-checking for probabilistic real-time systems
Alur, R., Courcoubetis, C., & Dill, D. (1991) · Lecture Notes in Computer Science · doi:10.1007/3-540-54233-7_128 · Cited by 177
Approximative Symbolic Model Checking of Continuous-Time Markov Chains
Christel Baier, A., Katoen, J.-P., & Hermanns, H. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48320-9_12 · Cited by 130
Cited by
PRISM 4.0: Verification of Probabilistic Real-Time Systems
Kwiatkowska, M., Norman, G., & Parker, D. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22110-1_47 · Cited by 2,361
Model-checking algorithms for continuous-time markov chains
Baier, C., Haverkort, B., Hermanns, H., & Katoen, J.-P. (2003) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2003.1205180 · Cited by 767
Statistical Model Checking: An Overview
Legay, A., Delahaye, B., & Bensalem, S. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-16612-9_11 · Cited by 421
Heuristics for Scalable Dynamic Test Generation
Burnim, J., & Sen, K. (2008) · 2008 23rd IEEE/ACM International Conference on Automated Software Engineering · doi:10.1109/ase.2008.69 · Cited by 412
Approximate Probabilistic Model Checking
Hérault, T., Lassaigne, R., Magniette, F., & Peyronnet, S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24622-0_8 · Cited by 295
A Survey of Statistical Model Checking
Agha, G., & Palmskog, K. (2018) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/3158668 · Cited by 285
Statistical Model Checking of Black-Box Probabilistic Systems
Sen, K., Viswanathan, M., & Agha, G. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-27813-9_16 · Cited by 281
Towards formal verification of IoT protocols: A Review
Hofer-Schmitz, K., & Stojanović, B. (2020) · Computer Networks · doi:10.1016/j.comnet.2020.107233 · Cited by 104
Probabilistic verification of fairness properties via concentration
Bastani, O., Zhang, X., & Solar-Lezama, A. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3360544 · Cited by 57
“Prior work has focused on developing inference rules for handling formulas in temporal logics such as continuous stochastic logic (CSL) [Sen et al. 2004; Younes and Simmons 2002] and linear temporal logic (LTL) [Hérault et al. 2004] rather than arithmetic formulas such as ours.”
Method
Metadata
- Authors
- Younes, H. L. S., & Simmons, R. G.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 223-235
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1489725951
- Cited by
- 373
- References
- 12
- FWCI
- 8.62
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.