On the public citation graph
On the synthesis of an asynchronous reactive module
0 signed · 305 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-18088-5_22openalex-snapshot
Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree
inferredcites →https://doi.org/10.1007/3-540-50403-6_28openalex-snapshot
A framework for the synthesis of reactive modules
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.1016/0022-0000(79)90046-1openalex-snapshot
Propositional dynamic logic of regular programs
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(87)90008-9openalex-snapshot
The complementation problem for Büchi automata with applications to temporal logic
inferredcites →https://doi.org/10.1016/s0019-9958(84)80047-9openalex-snapshot
Deciding full branching time logic
inferredcites →https://doi.org/10.1090/cbms/013openalex-snapshot
Automata on Infinite Objects and Church’s Problem
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/lics.1989.39188openalex-snapshot
On simultaneously determinizing and complementing omega -automata
inferredcites →https://doi.org/10.1109/sfcs.1988.21948openalex-snapshot
On the complexity of omega -automata
inferredcites →https://doi.org/10.1109/sfcs.1988.21949openalex-snapshot
The complexity of tree automata and logics of programs
inferredcites →https://doi.org/10.1109/swat.1972.28openalex-snapshot
The emptiness problem for automata on infinite trees
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/357233.357237openalex-snapshot
Synthesis of Communicating Processes from Temporal Logic Specifications
inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited
inferredcites →https://doi.org/10.1145/512644.512660openalex-snapshot
A really abstract concurrent model and its temporal logic
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.1145/75277.75293openalex-snapshot
On the synthesis of a reactive module
inferredcites →https://doi.org/10.1145/75277.75294openalex-snapshot
Synthesis of concurrent systems with many similar sequential processes (extended abstract)
inferredcites →https://doi.org/10.1145/800057.808665openalex-snapshot
Now you may compose temporal logic specifications
inferredcites →https://doi.org/10.2307/2273182openalex-snapshot
Substance and first-order quantification over individual-concepts
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.1002/9781118602638.ch6openalex-snapshot
Introduction to Verification
inferred← citeshttps://doi.org/10.1002/9781119723950.ch6openalex-snapshot
A Theory of Hypergames on Graphs for Synthesizing Dynamic Cyber Defense with Deception
inferred← citeshttps://doi.org/10.1007/11539452_42openalex-snapshot
Synthesis of Distributed Systems from Knowledge-Based Specifications
inferred← citeshttps://doi.org/10.1007/11795490_22openalex-snapshot
Revising UNITY Programs: Possibilities and Limitations
inferred← citeshttps://doi.org/10.1007/11874683_19openalex-snapshot
Algorithms for Omega-Regular Games with Imperfect Information
inferred← citeshttps://doi.org/10.1007/11901914_20openalex-snapshot
Synthesis for Probabilistic Environments
inferred← citeshttps://doi.org/10.1007/11944836_30openalex-snapshot
Distributed Synthesis for Well-Connected Architectures
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_14openalex-snapshot
Generalized Model Checking: Reasoning about Partial State Spaces
inferred← citeshttps://doi.org/10.1007/3-540-44674-5_1openalex-snapshot
Synthesizing State-Based Object Systems from LSC Specifications
inferred← citeshttps://doi.org/10.1007/3-540-45089-0_18openalex-snapshot
Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_1openalex-snapshot
Branching vs. Linear Time: Final Showdown
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-46428-x_3openalex-snapshot
From Play-In Scenarios to Code: An Achievable Dream
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_11openalex-snapshot
Synthesis of Large Concurrent Programs via Pairwise Composition
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_2openalex-snapshot
Alternating-time Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_28openalex-snapshot
A framework for the synthesis of reactive modules
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_62openalex-snapshot
MetateM: A framework for programming in temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_51openalex-snapshot
Realizability and synthesis of reactive modules
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_56openalex-snapshot
An automata-theoretic approach to fair realizability and synthesis
inferred← citeshttps://doi.org/10.1007/3-540-60472-3_1openalex-snapshot
Symbolic controller synthesis for discrete and timed systems
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_3openalex-snapshot
Automated temporal reasoning about reactive systems
inferred← citeshttps://doi.org/10.1007/978-1-4613-1309-0_4openalex-snapshot
A Novel Approach to Guiding Incremental Specification
inferred← citeshttps://doi.org/10.1007/978-3-030-01090-4_4openalex-snapshot
What’s to Come is Still Unsure
inferred← citeshttps://doi.org/10.1007/978-3-030-25540-4_35openalex-snapshot
Temporal Stream Logic: Synthesis Beyond the Bools
inferred← citeshttps://doi.org/10.1007/978-3-030-26619-6_5openalex-snapshot
Dynamic Reconfiguration of Business Processes
inferred← citeshttps://doi.org/10.1007/978-3-030-31784-3_22openalex-snapshot
Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-31784-3_23openalex-snapshot
Reactive Synthesis of Graphical User Interface Glue Code
inferred← citeshttps://doi.org/10.1007/978-3-030-51831-8_3openalex-snapshot
Synthesis for Multi-weighted Games with Branching-Time Winning Conditions
inferred← citeshttps://doi.org/10.1007/978-3-030-61739-4_2openalex-snapshot
Games with Full, Longitudinal, and Transverse Observability
inferred← citeshttps://doi.org/10.1007/978-3-030-79121-6_1openalex-snapshot
Back to the Future: A Fresh Look at Linear Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-81685-8_41openalex-snapshot
Adapting Behaviors via Reactive Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-030-89051-3_4openalex-snapshot
Program Synthesis for Musicians: A Usability Testbed for Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1007/978-3-030-92124-8_20openalex-snapshot
Fairness, Assumptions, and Guarantees for Extended Bounded Response LTL+P Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-06653-5_13openalex-snapshot
The Synthesis Problem for Repeatedly Communicating Petri Games
inferred← citeshttps://doi.org/10.1007/978-3-031-17146-8_11openalex-snapshot
Real-Time Policy Enforcement with Metric First-Order Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-19849-6_10openalex-snapshot
Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime
inferred← citeshttps://doi.org/10.1007/978-3-031-19992-9_21openalex-snapshot
STOMPC: Stochastic Model-Predictive Control with Uppaal Stratego
inferred← citeshttps://doi.org/10.1007/978-3-031-27481-7_28openalex-snapshot
Tableaux for Realizability of Safety Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-27901-0_6openalex-snapshot
Formal Modeling, Verification and Automated Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-30820-8_20openalex-snapshot
LTL Reactive Synthesis with a Few Hints
inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_20openalex-snapshot
Guessing Winning Policies in LTL Synthesis by Semantic Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-37709-9_15openalex-snapshot
Boolean Abstractions for Realizability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-031-41623-1_4openalex-snapshot
Foundations of Collaborative $$\textsf{DECLARE}$$
inferred← citeshttps://doi.org/10.1007/978-3-031-50521-8_3openalex-snapshot
A Navigation Logic for Recursive Programs with Dynamic Thread Creation
inferred← citeshttps://doi.org/10.1007/978-3-031-50524-9_9openalex-snapshot
Model-Guided Synthesis for LTL over Finite Traces
inferred← citeshttps://doi.org/10.1007/978-3-031-56222-8_3openalex-snapshot
SynthLearn: A Tool for Guided Reactive Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-57246-3_6openalex-snapshot
Fully Generalized Reactivity(1) Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-62645-6_13openalex-snapshot
Guess and Then Check: Controller Synthesis for Safe and Secure Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_9openalex-snapshot
Understanding Synthesized Reactive Systems Through Invariants
inferred← citeshttps://doi.org/10.1007/978-3-031-75434-0_11openalex-snapshot
LLM-Based Scheme for Synthesis of Formal Verification Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-78750-8_2openalex-snapshot
Predictable and Performant Reactive Synthesis Modulo Theories via Functional Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-82703-7_4openalex-snapshot
Synthesis of Parametric Locally Symmetric Protocols from Abstract Temporal Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-85134-6_1openalex-snapshot
Modelling Cyber-Physical Systems for Verification and Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-90643-5_12openalex-snapshot
SemML: Enhancing Automata-Theoretic LTL Synthesis with Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_11openalex-snapshot
Counter Example Guided Reactive Synthesis for LTL Modulo Theories$$^*$$
inferred← citeshttps://doi.org/10.1007/978-3-032-32519-8_16openalex-snapshot
SemML 2.0: Synthesizing Controllers for LTL
inferred← citeshttps://doi.org/10.1007/978-3-032-40774-0_19openalex-snapshot
Realizability Check for Pure Past Linear Temporal Logic on Finite Traces
inferred← citeshttps://doi.org/10.1007/978-3-0348-8970-4_23openalex-snapshot
Control Synthesis for Discrete Event Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_4openalex-snapshot
Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_1openalex-snapshot
From Reachability to Temporal Specifications in Cost-Sharing Games
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_27openalex-snapshot
Graph Games and Reactive Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-24953-7_27openalex-snapshot
On the Complexity of Model-Checking Branching and Alternating-Time Temporal Logics in One-Counter Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-44878-7_7openalex-snapshot
Real-Time Synthesis is Hard!
inferred← citeshttps://doi.org/10.1007/978-3-319-49052-6_9openalex-snapshot
Synthesis of Admissible Shields
inferred← citeshttps://doi.org/10.1007/978-3-319-54430-4_11openalex-snapshot
The Relation Between Syntax Restriction of Temporal Logic and Properties of Reactive System Specification
inferred← citeshttps://doi.org/10.1007/978-3-319-62407-5_16openalex-snapshot
Posting Graphs for Finding Non-Terminating Executions in Asynchronous Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_20openalex-snapshot
Synthesis of Asynchronous Reactive Programs from Temporal Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_23openalex-snapshot
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_23openalex-snapshot
The Complexity of Live Sequence Charts
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-540-39989-6_11openalex-snapshot
On the Implementation Complexity of Specifications of Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_2openalex-snapshot
Synthesis of Distributed Algorithms Using Asynchronous Automata
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-72912-9_11openalex-snapshot
Assumption-Based Composition and Monitoring of Web Services
inferred← citeshttps://doi.org/10.1007/978-3-540-72912-9_3openalex-snapshot
Analyzing Conversations: Realizability, Synchronizability, and Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_26openalex-snapshot
Revising Distributed UNITY Programs Is NP-Complete
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-00768-2_10openalex-snapshot
Computing Weakest Strategies for Safety Games of Imperfect Information
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_29openalex-snapshot
Compositional Control Synthesis for Partially Observable Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_33openalex-snapshot
Symbolic Bounded Synthesis
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-17511-4_18openalex-snapshot
Synthesis of Trigger Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-24372-1_17openalex-snapshot
Modal Transition Systems: Composition and LTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_8openalex-snapshot
Recent Challenges and Ideas in Temporal Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-27940-9_19openalex-snapshot
Effective Synthesis of Asynchronous Systems from GR(1) Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-29860-8_34openalex-snapshot
Monitoring Realizability
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_45openalex-snapshot
Acacia+, a Tool for LTL Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-34281-3_21openalex-snapshot
Stepwise Satisfiability Checking Procedure for Reactive System Specifications by Tableau Method and Proof System
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_26openalex-snapshot
Asynchronous Games over Tree Architectures
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_37openalex-snapshot
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_12openalex-snapshot
Comparison of LTL to Deterministic Rabin Automata Translators
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/978-3-662-49630-5_21openalex-snapshot
Distributed Synthesis in Continuous Time
inferred← citeshttps://doi.org/10.1007/978-981-96-4656-2_7openalex-snapshot
Automating Component-Based Embedded Software Construction via Formal Synthesis and LLMs
inferred← citeshttps://doi.org/10.1007/b104325openalex-snapshot
FSTTCS 2004 : foundations of software technology and theoretical computer science : 24th International Conference, Chennai, India, December 16-18, 2004 : proceedings
inferred← citeshttps://doi.org/10.1007/bf01439153openalex-snapshot
On control of systems modelled as deterministic Rabin automata
inferred← citeshttps://doi.org/10.1007/bfb0023741openalex-snapshot
Synthesizing processes and schedulers from temporal specifications
inferred← citeshttps://doi.org/10.1007/bfb0023782openalex-snapshot
Control of ω-automata, Church's problem, and the emptiness problem for tree ω-automata
inferred← citeshttps://doi.org/10.1007/bfb0032058openalex-snapshot
Proving partial order liveness properties
inferred← citeshttps://doi.org/10.1007/bfb0035748openalex-snapshot
Realizable and unrealizable specifications of reactive systems
inferred← citeshttps://doi.org/10.1007/bfb0055614openalex-snapshot
Synthesis from knowledge-based specifications
inferred← citeshttps://doi.org/10.1007/s00165-014-0325-8openalex-snapshot
Synthesizing bounded-time 2-phase fault recovery
inferred← citeshttps://doi.org/10.1007/s00236-016-0279-9openalex-snapshot
Parameterized linear temporal logics meet costs: still not costlier than LTL
inferred← citeshttps://doi.org/10.1007/s00236-020-00374-7openalex-snapshot
Indecision and delays are the parents of failure—taming them algorithmically by synthesizing delay-resilient control
inferred← citeshttps://doi.org/10.1007/s00446-011-0139-3openalex-snapshot
Symbolic synthesis of masking fault-tolerant distributed programs
inferred← citeshttps://doi.org/10.1007/s00446-014-0227-2openalex-snapshot
The complexity of automated addition of fault-tolerance without explicit legitimate states
inferred← citeshttps://doi.org/10.1007/s10009-012-0222-5openalex-snapshot
Exploiting structure in LTL synthesis
inferred← citeshttps://doi.org/10.1007/s10472-005-9003-0openalex-snapshot
The complexity of agent design problems: Determinism and history dependence
inferred← citeshttps://doi.org/10.1007/s10489-021-02658-yopenalex-snapshot
Rational verification: game-theoretic verification of multi-agent systems
inferred← citeshttps://doi.org/10.1007/s10619-008-7030-7openalex-snapshot
Dynamic composition and optimization of Web services
inferred← citeshttps://doi.org/10.1007/s10626-011-0101-3openalex-snapshot
Symbolic Supervisory Control of Infinite Transition Systems Under Partial Observation Using Abstract Interpretation
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/s10626-017-0243-zopenalex-snapshot
Augmented finite transition systems as abstractions for control synthesis
inferred← citeshttps://doi.org/10.1007/s10703-008-0064-7openalex-snapshot
Distributed synthesis for well-connected architectures
inferred← citeshttps://doi.org/10.1007/s10703-016-0252-9openalex-snapshot
Synthesis of large dynamic concurrent programs from dynamic specifications
inferred← citeshttps://doi.org/10.1007/s10703-021-00383-3openalex-snapshot
Extended bounded response LTL: a new safety fragment for efficient reactive synthesis
inferred← citeshttps://doi.org/10.1007/s10817-025-09737-6openalex-snapshot
LTL Reactive Synthesis with a Few Hints
inferred← citeshttps://doi.org/10.1007/s11334-024-00552-7openalex-snapshot
Robust computation tree logic
inferred← citeshttps://doi.org/10.1007/s11432-011-4460-zopenalex-snapshot
Complexity of synthesis of composite service with correctness guarantee
inferred← citeshttps://doi.org/10.1007/s42979-024-03337-8openalex-snapshot
Symbolic ltl$$_f$$ Synthesis: A Unified Approach for Synthesizing Winning, Dominant, and Best-Effort Strategies
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90007-iopenalex-snapshot
On undecidability of propositional temporal logics on trace systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90009-4openalex-snapshot
Proving partial order properties
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
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.2017.04.003openalex-snapshot
From model checking to equilibrium checking: Reactive modules for rational verification
inferred← citeshttps://doi.org/10.1016/j.ic.2016.07.009openalex-snapshot
Parametric Linear Dynamic Logic
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104500openalex-snapshot
Finite-state strategies in delay games
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104810openalex-snapshot
Robust, expressive, and quantitative linear temporal logics: Pick any two for free
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.04.044openalex-snapshot
Reinforcement Learning with Temporal Logic Constraints
inferred← citeshttps://doi.org/10.1016/j.ins.2024.120102openalex-snapshot
Standard specification-based intrusion detection for hierarchical industrial control systems
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.08.018openalex-snapshot
Decidability of well-connectedness for distributed synthesis
inferred← citeshttps://doi.org/10.1016/j.jal.2005.12.013openalex-snapshot
The computational complexity of scenario-based agent verification and design
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.08.007openalex-snapshot
Synthesis of Reactive(1) designs
inferred← citeshttps://doi.org/10.1016/j.scico.2010.05.009openalex-snapshot
Moving in a network under random failures: A complexity analysis
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.004openalex-snapshot
Conversation protocols: a formalism for specification and verification of reactive electronic services
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.07.039openalex-snapshot
Optimal bounds in parametric LTL games
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.001openalex-snapshot
Connectivity games over dynamic networks
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00374-0openalex-snapshot
Weak, strong, and strong cyclic planning via symbolic model checking
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00031-3openalex-snapshot
Planning control rules for reactive agents
inferred← citeshttps://doi.org/10.1038/s41598-025-85589-9openalex-snapshot
A synthesis method for zero-sum mean-payoff asynchronous probabilistic games
inferred← citeshttps://doi.org/10.1109/2.895118openalex-snapshot
From play-in scenarios to code: an achievable dream
inferred← citeshttps://doi.org/10.1109/9.728871openalex-snapshot
A method for the synthesis of controllers to handle safety, liveness, and real-time constraints
inferred← citeshttps://doi.org/10.1109/acc.2012.6315040openalex-snapshot
Switching protocol synthesis for temporal logic specifications
inferred← citeshttps://doi.org/10.1109/acsd.2017.9openalex-snapshot
A Backward Algorithm for the Multiprocessor Online Feasibility of Sporadic Tasks
inferred← citeshttps://doi.org/10.1109/apsec.2015.11openalex-snapshot
Designing Distributed Systems w.r.t. Conformance
inferred← citeshttps://doi.org/10.1109/ascc.2017.8287612openalex-snapshot
Path planning and control of a quadrotor UAV: A symbolic approach
inferred← citeshttps://doi.org/10.1109/case69030.2026.11704454openalex-snapshot
Controller Synthesis for Markov Decision Processes by Mu-Calculus
inferred← citeshttps://doi.org/10.1109/compsac48688.2020.0-146openalex-snapshot
Accuracy Improvement for Neural Program Synthesis via Attention Mechanism and Program Slicing
inferred← citeshttps://doi.org/10.1109/dsa.2019.00065openalex-snapshot
Synthesizing Secure Reactive Controller for Unmanned Aerial System
inferred← citeshttps://doi.org/10.1109/fscs.1990.89597openalex-snapshot
Distributed reactive systems are hard to synthesize
inferred← citeshttps://doi.org/10.1109/hicss.1995.375522openalex-snapshot
Compositional adjustment of concurrent programs to satisfy temporal logic constraints in MENDELS ZONE
inferred← citeshttps://doi.org/10.1109/iros.2015.7353862openalex-snapshot
Synthesizing cooperative reactive mission plans
inferred← citeshttps://doi.org/10.1109/iros.2015.7354078openalex-snapshot
Correct-by-synthesis reinforcement learning with temporal logic constraints
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/lics.1990.113770openalex-snapshot
On the power of bounded concurrency. III. Reasoning about programs
inferred← citeshttps://doi.org/10.1109/lics.2001.932514openalex-snapshot
Synthesizing distributed systems
inferred← citeshttps://doi.org/10.1109/lics.2017.8005125openalex-snapshot
Games with costs and delays
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470616openalex-snapshot
Perspective Multi-Player Games
inferred← citeshttps://doi.org/10.1109/mdat.2020.3034048openalex-snapshot
Cloud-Ready Acceleration of Formal Method Techniques for Cyber–Physical Systems
inferred← citeshttps://doi.org/10.1109/memcod.2009.5185372openalex-snapshot
Synthesis of programs from temporal property specifications
inferred← citeshttps://doi.org/10.1109/qrs.2018.00031openalex-snapshot
SynEva: Evaluating ML Programs by Mirror Program Synthesis
inferred← citeshttps://doi.org/10.1109/real.1992.242655openalex-snapshot
The input-output control of real-time discrete event systems
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/sfcs.1988.21949openalex-snapshot
The complexity of tree automata and logics of programs
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646098openalex-snapshot
Alternating-time temporal logic
inferred← citeshttps://doi.org/10.1109/smc.2015.33openalex-snapshot
Behavior Composition Meets Supervisory Control
inferred← citeshttps://doi.org/10.1109/tac.2013.2246095openalex-snapshot
Synthesis of Reactive Switching Protocols From Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1109/tac.2016.2593947openalex-snapshot
Feedback Refinement Relations for the Synthesis of Symbolic Controllers
inferred← citeshttps://doi.org/10.1109/tac.2022.3218932openalex-snapshot
A Framework for Output-Feedback Symbolic Control
inferred← citeshttps://doi.org/10.1109/tse.2005.137openalex-snapshot
From live sequence charts to state machines and back: a guided tour
inferred← citeshttps://doi.org/10.1109/tse.2005.141openalex-snapshot
Synchronizability of conversations among Web services
inferred← citeshttps://doi.org/10.1109/tse.2015.2510001openalex-snapshot
A Game-Theoretic Foundation for the Maximum Software Resilience against Dense Errors
inferred← citeshttps://doi.org/10.1109/wodes69290.2026.11598171openalex-snapshot
Controller Synthesis Unified by Mu-Calculus
inferred← citeshttps://doi.org/10.1137/060673862openalex-snapshot
Effective Control Synthesis for Partially Observed Discrete-Event Systems
inferred← citeshttps://doi.org/10.1142/s0129054106003784openalex-snapshot
COMPLETENESS AND REALIZABILITY: CONDITIONS FOR AUTOMATIC GENERATION OF WORKFLOWS
inferred← citeshttps://doi.org/10.1142/s0219198914400040openalex-snapshot
A GENERAL NOTION OF UNIFORM STRATEGIES
inferred← citeshttps://doi.org/10.1145/1462187.1462192openalex-snapshot
Complexity results in revising UNITY programs
inferred← citeshttps://doi.org/10.1145/1572272.1572275openalex-snapshot
Analyzing singularity channel contracts
inferred← citeshttps://doi.org/10.1145/2025113.2025153openalex-snapshot
Synthesizing data structure manipulations from storyboards
inferred← citeshttps://doi.org/10.1145/2185632.2185648openalex-snapshot
On synthesizing robust discrete controllers under modeling uncertainty
inferred← citeshttps://doi.org/10.1145/248052.248070openalex-snapshot
Synthesis of concurrent systems for an atomic read/atomic write model of computation
inferred← citeshttps://doi.org/10.1145/2480759.2480761openalex-snapshot
Fair Synthesis for Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1145/2559934openalex-snapshot
Model-based synthesis of control software from system-level formal specifications
inferred← citeshttps://doi.org/10.1145/271510.271519openalex-snapshot
Synthesis of concurrent systems with many similar processes
inferred← citeshttps://doi.org/10.1145/277697.277729openalex-snapshot
Synthesis of fault-tolerant concurrent programs
inferred← citeshttps://doi.org/10.1145/2833312.2833324openalex-snapshot
Stabilization and fault-tolerance in presence of unchangeable environment actions
inferred← citeshttps://doi.org/10.1145/2884781.2884856openalex-snapshot
Synthesizing framework models for symbolic execution
showing the first 200 of 279 · page through all 279
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.