The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Synthesis of Reactive(1) Designs
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
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
Design and synthesis of synchronization skeletons using branching time temporal logic
Clarke, E. M., & Emerson, E. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0025774 · Cited by 2,219
Results on the propositional μ-calculus
Kozen, D. C. (1983) · Theoretical Computer Science · doi:10.1016/0304-3975(82)90125-6 · Cited by 1,881
On the synthesis of a reactive module
Pnueli, A., & Rosner, R. (1989) · Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89 · doi:10.1145/75277.75293 · Cited by 1,432
Self-citationSynthesis of Communicating Processes from Temporal Logic Specifications
Manna, Z., & Wolper, P. (1984) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357233.357237 · Cited by 526
On the synthesis of an asynchronous reactive module
Pnueli, A., & Rosner, R. (1989) · Lecture notes in computer science · doi:10.1007/bfb0035790 · Cited by 383
Self-citationController Synthesis for Timed Automata 1
Asarin, E., Maler, O., Pnueli, A., & Sifakis, J. (1998) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)42032-5 · Cited by 309
Self-citationBüchi, J. R. (1964) · Journal of Symbolic Logic · doi:10.2307/2270398 · Cited by 232
Deterministic generators and games for Ltl fragments
Alur, R., & Torre, S. L. (2004) · ACM Transactions on Computational Logic · doi:10.1145/963927.963928 · Cited by 133
Verification by Augmented Finitary Abstraction
Kesten, Y., & Pnueli, A. (2000) · Information and Computation · doi:10.1006/inco.2000.3000 · Cited by 77
Self-citation
Cited by
Temporal-Logic-Based Reactive Mission and Motion Planning
Kress-Gazit, H., Fainekos, G. E., & Pappas, G. J. (2009) · IEEE Transactions on Robotics · doi:10.1109/tro.2009.2030225 · Cited by 750
Web Service Composition: A Survey of Techniques and Tools
Lemos, A. L., Daniel, F., & Benatallah, B. (2016) · ACM Computing Surveys · doi:10.1145/2831270 · Cited by 320
Control Barrier Functions for Signal Temporal Logic Tasks
Lindemann, L., & Dimarogonas, D. V. (2019) · IEEE Control Systems Letters · doi:10.1109/lcsys.2018.2853182 · Cited by 319
Receding Horizon Temporal Logic Planning
Wongpiromsarn, T., Topcu, U., & Murray, R. M. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2195811 · Cited by 292
Correct-by-synthesis reinforcement learning with temporal logic constraints
Wen, M., Ehlers, R., & Topcu, U. (2015) · 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2015.7354078 · Cited by 59
Metadata
- Authors
- Piterman, N., Pnueli, A., & Sa’ar, Y.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 364-380
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W3023554972
- Cited by
- 560
- References
- 10
- FWCI
- 8.50
- 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.