The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
On the synthesis of a reactive module
Open accessAbstract
We consider the synthesis of a reactive module with input x and output y, which is specified by the linear temporal formula @@@@(x, y). We show that there exists a program satisfying @@@@ iff the branching time formula (∀x) (∃y) A@@@@(x, y) is valid over all tree models. For the restricted case that all variables range over finite domains, the validity problem is decidable, and we present an algorithm for constructing the program whenever it exists. The algorithm is based on a new procedure for checking the emptiness of Rabin automata on infinite trees in time exponential in the number of pairs, but only polynomial in the number of states. This leads to a synthesis algorithm whose complexity is double exponential in the length of the given 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
Statecharts: a visual formalism for complex systems
Harel, D. (1987) · Science of Computer Programming · doi:10.1016/0167-6423(87)90035-9 · Cited by 6,751
The temporal logic of programs
Pnueli, A. (1977) · 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) · doi:10.1109/sfcs.1977.32 · Cited by 5,689
Self-citationAutomatic 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
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
The complexity of propositional linear temporal logics
Sistla, A. P., & Clarke, E. M. (1985) · Journal of the ACM · doi:10.1145/3828.3837 · Cited by 1,095
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
Clarke, E. M., & Emerson, E. A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-69850-0_12 · Cited by 1,070
“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 Development of Reactive Systems
Harel, D., & Pnueli, A. (1985) · Logics and Models of Concurrent Systems · doi:10.1007/978-3-642-82453-1_17 · Cited by 859
Self-citationOn 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
Self-citationA Deductive Approach to Program Synthesis
Manna, Z., & Waldinger, R. (1980) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357084.357090 · Cited by 573
Synthesis 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
Automata-theoretic techniques for modal logics of programs
Vardi, M. Y., & Wolper, P. (1986) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(86)90026-7 · Cited by 522
Pnueli, A. (1986) · Lecture Notes in Computer Science · doi:10.1007/bfb0027047 · Cited by 450
Self-citationDesign and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic
Clarke, E. M., & Emerson, E. A. (2018) · doi:10.1184/r1/6604769 · Cited by 359
Büchi, J. R. (1964) · Journal of Symbolic Logic · doi:10.2307/2270398 · Cited by 232
Improved upper and lower bounds for modal logics of programs
Vardi, M. Y., & Stockmeyer, L. (1985) · doi:10.1145/22145.22173 · Cited by 139
A Deductive Approach to Program Synthesis
Manna, Z., & Waldinger, R. J. (1981) · Elsevier eBooks · doi:10.1016/b978-0-934613-03-3.50015-5 · Cited by 46
Cited by
EMERSON, E. A. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50021-4 · Cited by 2,585
Alternating-time temporal logic
Alur, R., Henzinger, T. A., & Kupferman, O. (2002) · Journal of the ACM · doi:10.1145/585265.585270 · Cited by 1,394
Agent-based software engineering
Wooldridge, M. (1997) · IEE Proceedings - Software Engineering · doi:10.1049/ip-sen:19971026 · Cited by 803
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
A survey of symbolic execution techniques
Baldoni, R., Coppa, E., D’elia, D. C., Demetrescu, C., & Finocchi, I. (2019) · ACM Computing Surveys · doi:10.1145/3182657 · Cited by 708
Metadata
- Authors
- Pnueli, A., & Rosner, R.
- Venue
- Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89
- Publisher
- ACM Press
- Published
- 1989
- Pages
- 179-190
- OpenAlex
- W2016206563
- Cited by
- 1,432
- References
- 17
- FWCI
- 6.74
- 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.