The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Model checking of probabilistic and nondeterministic systems
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
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
The Temporal Logic of Reactive and Concurrent Systems: Specification
Pnueli, A., & Manna, Z. (1991) · Cited by 1,352
Automatic verification of probabilistic concurrent finite state programs
Vardi, M. Y. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.12 · Cited by 680
Automatic verification of finite state concurrent system using temporal logic specifications
Clarke, E. M., Emerson, E. A., & Sistla, A. P. (1983) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/567067.567080 · Cited by 416
It usually works: The temporal logic of stochastic systems
Aziz, A., Singhal, V., Balarin, F., Brayton, R. K., & Sangiovanni-Vincentelli, A. L. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60045-0_48 · Cited by 222
Theory of linear and integer programming
Potts, C. N. (1988) · European Journal of Operational Research · doi:10.1016/0377-2217(88)90189-0 · Cited by 188
Reasoning with time and chance
Lehmann, D. J., & Shelah, S. (1982) · Information and Control · doi:10.1016/s0019-9958(82)91022-1 · Cited by 136
Verifying temporal properties of finite-state probabilistic programs
Courcoubetis, C., & Yannakakis, M. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21950 · Cited by 126
On the extremely fair treatment of probabilistic algorithms
Pnueli, A. (1983) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800061.808757 · Cited by 95
A framework for reasoning about time and reliability
Hansson, H., & Jönsson, B. (2003) · IEEE Real-Time Systems Symposium (RTSS) · doi:10.1109/real.1989.63561 · Cited by 92
Probabilistic temporal logics for finite and bounded models
Sergiu Hart, A., & Sharir, M. (1984) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800057.808660 · Cited by 78
Verifying automata specifications of probabilistic real-time systems
Rajeev Alur, A., Courcoubetis, C., & Dill, D. L. (1992) · Lecture notes in computer science · doi:10.1007/bfb0031986 · Cited by 56
Tight bounds on the complexity of cascaded decomposition of automata
Maler, O., & Pnueli, A. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/fscs.1990.89589 · Cited by 30
Cited by
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
Kwiatkowska, M., Norman, G., & Parker, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72522-0_6 · Cited by 590
Probabilistic symbolic model checking with PRISM: a hybrid approach
Kwiatkowska, M., Norman, G., & Parker, D. (2004) · International Journal on Software Tools for Technology Transfer · doi:10.1007/s10009-004-0140-2 · Cited by 435
Dynamic QoS Management and Optimization in Service-Based Systems
Calinescu, R., Grunske, L., Kwiatkowska, M., Mirandola, R., & Tamburrelli, G. (2011) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2010.92 · Cited by 374
Automated Verification Techniques for Probabilistic Systems
Forejt, V., Kwiatkowska, M., Norman, G., & Parker, D. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-21455-4_3 · Cited by 319
Metadata
- Authors
- Bianco, A., & Alfaro, L.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1995
- Pages
- 499-513
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1601373402
- Cited by
- 408
- References
- 13
- FWCI
- 1.08
- Type
- conference paper
- 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.