On the public citation graph
Synthesis from knowledge-based specifications
0 signed · 70 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.1006/inco.1994.1092openalex-snapshot
Reasoning about Infinite Computations
inferredcites →https://doi.org/10.1007/3-540-58179-0_51openalex-snapshot
Realizability and synthesis of reactive modules
inferredcites →https://doi.org/10.1007/3-540-58179-0_53openalex-snapshot
Methodology and system for practical formal verification of reactive hardware
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/3-540-62034-6_55openalex-snapshot
Finite state implementations of knowledge-based programs
inferredcites →https://doi.org/10.1007/3-540-63104-6_19openalex-snapshot
Alternating automata: Unifying truth and validity checking for temporal logics
inferredcites →https://doi.org/10.1007/978-1-4612-0931-7openalex-snapshot
The Temporal Logic of Reactive and Concurrent Systems
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
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-94-015-9586-5_6openalex-snapshot
Synthesis with Incomplete Informatio
inferredcites →https://doi.org/10.1007/bfb0023741openalex-snapshot
Synthesizing processes and schedulers from temporal specifications
inferredcites →https://doi.org/10.1007/bfb0035748openalex-snapshot
Realizable and unrealizable specifications 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/0160-9327(87)90290-0openalex-snapshot
Annual review of computer science, vol. 1, 1986
inferredcites →https://doi.org/10.1016/0165-4896(94)90005-1openalex-snapshot
Reasoning about knowledge
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(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-934613-04-0.50016-8openalex-snapshot
The Logic of Distributed Protocols
inferredcites →https://doi.org/10.1090/dimacs/003/13openalex-snapshot
Synthesizing processes and schedulers from temporal specifications
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/fscs.1990.89597openalex-snapshot
Distributed reactive systems are hard to synthesize
inferredcites →https://doi.org/10.1109/sfcs.1988.21949openalex-snapshot
The complexity of tree automata and logics of programs
inferredcites →https://doi.org/10.1137/s0363012994272903openalex-snapshot
Centralized and Decentralized Supervisory Control of Nondeterministic Systems Under Partial Observation
inferredcites →https://doi.org/10.1145/146637.146638openalex-snapshot
A little knowledge goes a long way
inferredcites →https://doi.org/10.1145/276698.276748openalex-snapshot
Weak alternating automata and tree automata emptiness
inferredcites →https://doi.org/10.1145/357233.357237openalex-snapshot
Synthesis of Communicating Processes from Temporal Logic Specifications
inferredcites →https://doi.org/10.1145/362946.362970openalex-snapshot
A note on reliable full-duplex transmission over half-duplex links
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.1145/79147.79161openalex-snapshot
Knowledge and common knowledge in a distributed environment
inferredcites →https://doi.org/10.1145/800222.806736openalex-snapshot
Knowledge, common knowledge and related puzzles (Extended Summary)
inferredcites →https://doi.org/10.1146/annurev.cs.02.060187.000345openalex-snapshot
Using Reasoning About Knowledge to Analyze Distributed Systems
inferredcites →https://doi.org/10.2307/1994916openalex-snapshot
Solving Sequential Conditions by Finite-State Strategies
inferredcites →https://doi.org/10.7551/mitpress/5803.001.0001openalex-snapshot
Reasoning About Knowledge
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/11539452_42openalex-snapshot
Synthesis of Distributed Systems from Knowledge-Based Specifications
inferred← citeshttps://doi.org/10.1007/3-540-36540-0_3openalex-snapshot
Validation of Multiagent Systems by Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_35openalex-snapshot
Model Checking Knowledge and Time in Systems with Perfect Recall
inferred← citeshttps://doi.org/10.1007/978-3-030-32409-4_9openalex-snapshot
Simulations for Multi-Agent Systems with Imperfect Information
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_29openalex-snapshot
Safraless Synthesis for Epistemic Temporal Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_30openalex-snapshot
Knowledge-Based Synthesis of Distributed Systems Using Event Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-37621-7_8openalex-snapshot
Decision Procedures for Several Properties of Reactive System Specifications
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-54862-8_39openalex-snapshot
Symbolic Synthesis for Epistemic Specifications with Observational Semantics
inferred← citeshttps://doi.org/10.1007/s00236-025-00507-wopenalex-snapshot
Explainability requirements as hyperproperties
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.2009.12.002openalex-snapshot
Automated composition of Web services via planning in asynchronous domains
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103365openalex-snapshot
Knowledge-based programs as succinct policies for partially observable domains
inferred← citeshttps://doi.org/10.1016/j.ic.2015.03.012openalex-snapshot
Uniform strategies, rational relations and jumping automata
inferred← citeshttps://doi.org/10.1023/a:1026185103185openalex-snapshot
Cooperation, Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications
inferred← citeshttps://doi.org/10.1093/logcom/exw002openalex-snapshot
Dynamic epistemic logic in update logic
inferred← citeshttps://doi.org/10.1109/cdc.2018.8619353openalex-snapshot
Synthesis of Surveillance Strategies via Belief Abstraction
inferred← citeshttps://doi.org/10.1109/ispse.2000.913222openalex-snapshot
Program synthesis for stepwise satisfiable specification of reactive system
inferred← citeshttps://doi.org/10.1109/sefm.2004.1347501openalex-snapshot
Finding the causes of unrealizability of reactive system formal specifications
inferred← citeshttps://doi.org/10.1109/sefm.2004.17openalex-snapshot
Finding the causes of unrealizability of reactive system formal specifications
inferred← citeshttps://doi.org/10.1109/synasc.2018.00031openalex-snapshot
Experimental Evaluation of Acacia-K: A Tool for Synthesis of Reactive Systems from KLTL+ Specifications
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8228openalex-snapshot
Synthesizing Strategies for Epistemic Goals by Epistemic Model Checking: An Application to Pursuit Evasion Games
inferred← citeshttps://doi.org/10.2168/lmcs-7(2:14)2011openalex-snapshot
Knowledge-Based Synthesis of Distributed Systems Using Event Structures
inferred← citeshttps://doi.org/10.24963/ijcai.2019/221openalex-snapshot
The Complexity of Model Checking Knowledge and Time
inferred← citeshttps://doi.org/10.25911/5d78d9f7865dbopenalex-snapshot
Arrows for knowledge-based circuits
inferred← citeshttps://doi.org/10.3166/jancl.21.289-321openalex-snapshot
DEL-sequents for progression
inferred← citeshttps://doi.org/10.4204/eptcs.202.9openalex-snapshot
The complexity of approximations for epistemic synthesis (extended abstract)
inferred← citeshttps://doi.org/10.48550/arxiv.2001.07141openalex-snapshot
Dynamic Epistemic Logic Games with Epistemic Temporal Goals
inferred← citeshttps://doi.org/10.70675/651d709ez844dz4875z8ce4z4aaa692837eaopenalex-snapshot
Synthesis of Interactive Reactive Systems
inferred← citeshttps://doi.org/10.70675/b61498f6zf38dz4e84zbdeaz264d437574afopenalex-snapshot
Logical foundations of games with imperfect information : uniform strategies
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.