On the public citation graph
Church's Problem Revisited
0 signed · 94 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-58179-0_50openalex-snapshot
An automata-theoretic approach to branching-time model checking (Extended abstract)
inferredcites →https://doi.org/10.1007/3-540-60045-0_56openalex-snapshot
An automata-theoretic approach to fair realizability and synthesis
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_29openalex-snapshot
Solving Sequential Conditions by Finite-State Strategies
inferredcites →https://doi.org/10.1007/978-1-4615-2217-1openalex-snapshot
Modeling and Control of Logical Discrete Event Systems
inferredcites →https://doi.org/10.1007/978-3-0348-9078-6openalex-snapshot
Proceedings of the International Congress of Mathematicians
inferredcites →https://doi.org/10.1007/978-3-642-82453-1openalex-snapshot
Logics and Models of Concurrent Systems
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_17openalex-snapshot
On the Development of Reactive Systems
inferredcites →https://doi.org/10.1007/bfb0035790openalex-snapshot
On the synthesis of an asynchronous reactive module
inferredcites →https://doi.org/10.1016/0022-0000(85)90001-7openalex-snapshot
Decision procedures and expressiveness in the temporal logic of branching time
inferredcites →https://doi.org/10.1016/0022-0000(86)90026-7openalex-snapshot
Automata-theoretic techniques for modal logics of programs
inferredcites →https://doi.org/10.1016/0167-6423(83)90017-5openalex-snapshot
Using branching time temporal logic to synthesize synchronization skeletons
inferredcites →https://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot
The temporal semantics of concurrent programs
inferredcites →https://doi.org/10.1016/0304-3975(87)90133-2openalex-snapshot
Alternating automata on infinite trees
inferredcites →https://doi.org/10.1016/0304-3975(94)00214-4openalex-snapshot
Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferredcites →https://doi.org/10.1016/s0019-9958(84)80047-9openalex-snapshot
Deciding full branching time logic
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0280205-0openalex-snapshot
Solving sequential conditions by finite-state strategies
inferredcites →https://doi.org/10.1109/fscs.1990.89597openalex-snapshot
Distributed reactive systems are hard to synthesize
inferredcites →https://doi.org/10.1137/s0363012994272903openalex-snapshot
Centralized and Decentralized Supervisory Control of Nondeterministic Systems Under Partial Observation
inferredcites →https://doi.org/10.1137/siconopenalex-snapshot
SIAM Journal on Control and Optimization
inferredcites →https://doi.org/10.1145/158511.158524openalex-snapshot
Imperative functional programming
inferredcites →https://doi.org/10.1145/22145.22173openalex-snapshot
Improved upper and lower bounds for modal logics of programs
inferredcites →https://doi.org/10.1145/357084.357090openalex-snapshot
A Deductive Approach to Program Synthesis
inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
inferredcites →https://doi.org/10.1145/75277.75293openalex-snapshot
On the synthesis of a reactive module
inferredcites →https://doi.org/10.7551/mitpress/6874.001.0001openalex-snapshot
Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11562948_21openalex-snapshot
Semi-automatic Distributed Synthesis
inferred← citeshttps://doi.org/10.1007/11901914_20openalex-snapshot
Synthesis for Probabilistic Environments
inferred← citeshttps://doi.org/10.1007/11944836_21openalex-snapshot
Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
inferred← citeshttps://doi.org/10.1007/11944836_30openalex-snapshot
Distributed Synthesis for Well-Connected Architectures
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_26openalex-snapshot
Modular Strategies for Recursive Game Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_9openalex-snapshot
Open Systems in Reactive Environments: Control and Synthesis
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_55openalex-snapshot
Synthesis of Uninitialized Systems
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_5openalex-snapshot
Infinite Games and Verification
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_11openalex-snapshot
A Decidable Class of Asynchronous Distributed Controllers
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_33openalex-snapshot
Distributed Controller Synthesis for Local Specifications
inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_7openalex-snapshot
GR(1)*: GR(1) Specifications Extended with Existential Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-319-17130-2_15openalex-snapshot
Synthesis with Rational Environments
inferred← citeshttps://doi.org/10.1007/978-3-319-41591-8_11openalex-snapshot
Program Generation Using Simulated Annealing and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-60252-3_1openalex-snapshot
Sensing as a Complexity Measure
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_31openalex-snapshot
ATL* Satisfiability Is 2EXPTIME-Complete
inferred← citeshttps://doi.org/10.1007/978-3-540-71410-1_10openalex-snapshot
Synthesis of Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_20openalex-snapshot
Distributed Synthesis for Alternating-Time Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_16openalex-snapshot
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_24openalex-snapshot
Synthesis of Fault-Tolerant Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_52openalex-snapshot
Asynchronous Omega-Regular Games with Partial Information
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_48openalex-snapshot
Distributed Synthesis for Regular and Contextfree Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-54830-7_15openalex-snapshot
Latticed-LTL Synthesis in the Presence of Noisy Inputs
inferred← citeshttps://doi.org/10.1007/s00165-021-00535-6openalex-snapshot
GR(1)*: GR(1) specifications extended withexistential guarantees
inferred← citeshttps://doi.org/10.1007/s00236-014-0194-xopenalex-snapshot
Distributed synthesis for regular and contextfree specifications
inferred← citeshttps://doi.org/10.1007/s10472-016-9508-8openalex-snapshot
Synthesis with rational environments
inferred← citeshttps://doi.org/10.1007/s10626-015-0223-0openalex-snapshot
Supervisory control and reactive synthesis: a comparative introduction
inferred← citeshttps://doi.org/10.1007/s10626-017-0242-0openalex-snapshot
Latticed-LTL synthesis in the presence of noisy inputs
inferred← citeshttps://doi.org/10.1007/s10703-008-0064-7openalex-snapshot
Distributed synthesis for well-connected architectures
inferred← citeshttps://doi.org/10.1016/j.artint.2012.12.001openalex-snapshot
Automatic behavior composition synthesis
inferred← citeshttps://doi.org/10.1016/j.ic.2015.03.013openalex-snapshot
Synthesizing structured reactive programs via deterministic tree automata
inferred← citeshttps://doi.org/10.1016/j.ic.2018.05.001openalex-snapshot
CTL* with graded path modalities
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104856openalex-snapshot
Synthesis in presence of dynamic links
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.017openalex-snapshot
Modular strategies for recursive game graphs
inferred← citeshttps://doi.org/10.1017/jsl.2025.10090openalex-snapshot
BETWEEN PROOF CONSTRUCTION AND SAT-SOLVING
inferred← citeshttps://doi.org/10.1093/logcom/exw002openalex-snapshot
Dynamic epistemic logic in update logic
inferred← citeshttps://doi.org/10.1109/acc.2010.5530904openalex-snapshot
Concurrent program synthesis based on supervisory control
inferred← citeshttps://doi.org/10.1109/lics.2001.932514openalex-snapshot
Synthesizing distributed systems
inferred← citeshttps://doi.org/10.1109/lics.2017.8005136openalex-snapshot
Strategy logic with imperfect information
inferred← citeshttps://doi.org/10.1109/tcad.2012.2194491openalex-snapshot
Verifying Coalitions in 3-Party Systems
inferred← citeshttps://doi.org/10.1142/s0129054107004590openalex-snapshot
SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS
inferred← citeshttps://doi.org/10.1142/s0129054119400203openalex-snapshot
Sensing as a Complexity Measure
inferred← citeshttps://doi.org/10.1145/2480759.2480761openalex-snapshot
Fair Synthesis for Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1145/333979.333987openalex-snapshot
An automata-theoretic approach to branching-time model checking
inferred← citeshttps://doi.org/10.1145/3427955openalex-snapshot
Strategy Logic with Imperfect Information
inferred← citeshttps://doi.org/10.3166/jancl.21.289-321openalex-snapshot
DEL-sequents for progression
inferred← citeshttps://doi.org/10.3166/jesa.39.381-393openalex-snapshot
Observation partielle des systèmes temporisés
inferred← citeshttps://doi.org/10.3182/20140514-3-fr-4046.00018openalex-snapshot
Bridging the Gap between Supervisory Control and Reactive Synthesis: Case of Full Observation and Centralized Control
inferred← citeshttps://doi.org/10.3233/978-1-61499-627-9-72openalex-snapshot
Synthesis of Reactive Systems
inferred← citeshttps://doi.org/10.4204/eptcs.112.16openalex-snapshot
Synthesizing Structured Reactive Programs via Deterministic Tree Automata
inferred← citeshttps://doi.org/10.4204/eptcs.326.3openalex-snapshot
Synthesis in Presence of Dynamic Links
inferred← citeshttps://doi.org/10.4204/eptcs.347.5openalex-snapshot
A Semantic Model for Interacting Cyber-Physical Systems
inferred← citeshttps://doi.org/10.4204/eptcs.84.1openalex-snapshot
Sparse Positional Strategies for Safety Games
inferred← citeshttps://doi.org/10.4230/lipics.csl.2011.428openalex-snapshot
Synthesizing Reactive Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1003.1684openalex-snapshot
Generalised Rabin(1) synthesis
inferred← citeshttps://doi.org/10.48550/arxiv.1108.0315openalex-snapshot
Small witnesses, accepting lassos and winning strategies in omega-automata and games
inferred← citeshttps://doi.org/10.48550/arxiv.1611.03524openalex-snapshot
Quantified CTL with imperfect information
inferred← citeshttps://doi.org/10.48550/arxiv.1808.09430openalex-snapshot
Reactive Synthesis: Branching Logics and Parameterized Systems
inferred← citeshttps://doi.org/10.6092/unina/fedoa/10094openalex-snapshot
Logics for Multi-Agent Systems Verification
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.