The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Automatic verification of probabilistic concurrent finite state programs
Abstract
The verification problem for probabilistic concurrent finite-state program is to decide whether such a program satisfies its linear temporal logic specification. We describe an automata-theoretic approach, whereby probabilistic quantification over sets of computations is reduced to standard quantification over individual computations. Using new determinization construction for ω-automata, we manage to improve the time complexity of the algorithm by two exponentials. The time complexity of the final algorithm is polynomial in the size of the program and doubly exponential in the size of the specification.
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
Kenny, A. (2018) · Carl Strehlow’s 1909 Comparative Heritage Dictionary: An Aranda, German, Loritja and Dieri to English Dictionary with Introductory Essays · doi:10.22459/cschd.08.2018.04 · Cited by 3,216
Automata, Languages, and Machines
(1974) · Pure and applied mathematics · doi:10.1016/s0079-8169(08)x6055-6 · Cited by 1,897
On a Decision Method in Restricted Second Order Arithmetic
Büchi, J. R. (1990) · The Collected Works of J. Richard Büchi · doi:10.1007/978-1-4613-8928-6_23 · Cited by 1,271
Decidability of second-order theories and automata on infinite trees.
Rabin, M. O. (1969) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1969-0246760-1 · Cited by 1,173
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Emerson, E. A., & Halpern, J. Y. (1986) · Journal of the ACM · doi:10.1145/4904.4999 · Cited by 1,009
On the temporal analysis of fairness
Gabbay, D. M., Pnueli, A., Shelah, S., & Stavi, J. (1980) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/567446.567462 · Cited by 732
The temporal semantics of concurrent programs
Pnueli, A. (1981) · Theoretical Computer Science · doi:10.1016/0304-3975(81)90110-9 · Cited by 699
Checking that finite state concurrent programs satisfy their linear specification
Lichtenstein, O., & Pnueli, A. (1985) · ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) · doi:10.1145/318593.318622 · Cited by 621
The equivalence problem for regular expressions with squaring requires exponential space
Meyer, A. R., & Stockmeyer, L. J. (1972) · 13th Annual Symposium on Switching and Automata Theory (swat 1972) · doi:10.1109/swat.1972.29 · Cited by 596
Rabin, M. O. (1983) · 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) · doi:10.1109/sfcs.1983.48 · Cited by 589
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
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
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
Model checking of probabilistic and nondeterministic systems
Bianco, A., & Alfaro, L. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60692-0_70 · Cited by 408
Gordon, A. D., Henzinger, T. A., Nori, A. V., & Rajamani, S. K. (2014) · Future of Software Engineering Proceedings · doi:10.1145/2593882.2593900 · Cited by 357
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
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
Metadata
- Authors
- Vardi, M. Y.
- Venue
- 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
- Publisher
- IEEE
- Published
- 1985
- Pages
- 327-338
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2165161585
- Cited by
- 680
- References
- 22
- FWCI
- 3.83
- 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.