On the public citation graph
Synthesizing processes and schedulers from temporal specifications
0 signed · 66 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/978-1-4613-8928-6_29openalex-snapshot
Solving Sequential Conditions by Finite-State Strategies
inferredcites →https://doi.org/10.1007/bfb0032042openalex-snapshot
Automata for modeling real-time systems
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.1090/cbms/013openalex-snapshot
Automata on Infinite Objects and Church’s Problem
inferredcites →https://doi.org/10.1090/dimacs/003/13openalex-snapshot
Synthesizing processes and schedulers from temporal specifications
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.1983.51openalex-snapshot
Reasoning about infinite computation paths
inferredcites →https://doi.org/10.1109/sfcs.1988.21949openalex-snapshot
The complexity of tree automata and logics of programs
inferredcites →https://doi.org/10.1145/75277.75293openalex-snapshot
On the synthesis of a reactive module
inferredcites →https://doi.org/10.1145/800057.808665openalex-snapshot
Now you may compose temporal logic specifications
inferredcites →https://doi.org/10.2307/2270398openalex-snapshot
Alonzo Church. Logic, arithmetic, and automata. Proceedings of the International Congress of Mathematicians, 15–22 August 1962, Institut Mittag-Leffler, Djursholm, Sweden, 1963, pp. 23–35.
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/stvr.441openalex-snapshot
A framework for automatic generation of security controller
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-44674-5_1openalex-snapshot
Synthesizing State-Based Object Systems from LSC Specifications
inferred← citeshttps://doi.org/10.1007/3-540-45352-0_9openalex-snapshot
Automating the Addition of Fault-Tolerance
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-60045-0_56openalex-snapshot
An automata-theoretic approach to fair realizability and synthesis
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_57openalex-snapshot
Supervisory control of finite state machines
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-61377-3_49openalex-snapshot
Effective strategies for enumeration games
inferred← citeshttps://doi.org/10.1007/978-1-4757-6656-1_3openalex-snapshot
Problems and Examples of Decentralized Observation and Control for Discrete Event Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-26129-4_10openalex-snapshot
Formulation of Homeostasis by Realisability on Linear Temporal Logic
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-85778-5_11openalex-snapshot
On Scheduling Policies for Streams of Structured Jobs
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_9openalex-snapshot
Compositional Synthesis of Reactive Systems from Live Sequence Chart 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-17511-4_18openalex-snapshot
Synthesis of Trigger Properties
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-27660-6_8openalex-snapshot
Recent Challenges and Ideas in Temporal Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-33704-8_3openalex-snapshot
From Qualitative to Quantitative Enforcement of Security Policy
inferred← citeshttps://doi.org/10.1007/bf01439153openalex-snapshot
On control of systems modelled as deterministic Rabin automata
inferred← citeshttps://doi.org/10.1007/bf02572426openalex-snapshot
Canonical equiaffine hypersurfaces in ℝ n+1
inferred← citeshttps://doi.org/10.1007/bfb0032043openalex-snapshot
Markov decision processes and regular events
inferred← citeshttps://doi.org/10.1007/bfb0055614openalex-snapshot
Synthesis from knowledge-based specifications
inferred← citeshttps://doi.org/10.1007/s00236-014-0194-xopenalex-snapshot
Distributed synthesis for regular and contextfree specifications
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/s10703-016-0252-9openalex-snapshot
Synthesis of large dynamic concurrent programs from dynamic specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.08.008openalex-snapshot
Synthesis from scenario-based specifications
inferred← citeshttps://doi.org/10.1109/100.298482openalex-snapshot
A subject-indexed bibliography of discrete event dynamic systems
inferred← citeshttps://doi.org/10.1109/acc.2002.1024792openalex-snapshot
Failure diagnosis of discrete event systems with linear-time temporal logic fault specifications
inferred← citeshttps://doi.org/10.1109/acsd.2013.4openalex-snapshot
Maximal Synthesis for Hennessy-Milner Logic
inferred← citeshttps://doi.org/10.1109/cdc.1992.371185openalex-snapshot
Controllability subsets of live Rabin automata
inferred← citeshttps://doi.org/10.1109/cdc.2001.980822openalex-snapshot
Undecidable problems of decentralized observation and control
inferred← citeshttps://doi.org/10.1109/cdc.2001.980826openalex-snapshot
Supervisory control of discrete event systems with CTL* temporal logic specifications
inferred← citeshttps://doi.org/10.1109/cdc.2004.1428603openalex-snapshot
Symmetry reductions for a class of discrete-event systems
inferred← citeshttps://doi.org/10.1109/iccad.1995.480192openalex-snapshot
Sequential synthesis using S1S
inferred← citeshttps://doi.org/10.1109/jcit.1990.128356openalex-snapshot
An interleaving model for real-time
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/sfcs.1992.267774openalex-snapshot
Back to the future: towards a theory of timed regular languages
inferred← citeshttps://doi.org/10.1109/tac.2004.829616openalex-snapshot
Failure Diagnosis of Discrete-Event Systems With Linear-Time Temporal Logic Specifications
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.1137/s0363012902409982openalex-snapshot
Supervisory Control of Discrete Event Systems with CTL* Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1137/s0363012991217536openalex-snapshot
Control of Infinite Behavior of Finite Automata
inferred← citeshttps://doi.org/10.1145/2680540openalex-snapshot
Maximal Synthesis for Hennessy-Milner Logic
inferred← citeshttps://doi.org/10.1145/277697.277729openalex-snapshot
Synthesis of fault-tolerant concurrent programs
inferred← citeshttps://doi.org/10.1145/383043.383044openalex-snapshot
Synthesis of concurrent programs for an atomic read/write model of computation
inferred← citeshttps://doi.org/10.1145/963778.963782openalex-snapshot
Synthesis of fault-tolerant concurrent programs
inferred← citeshttps://doi.org/10.48550/arxiv.0801.1687openalex-snapshot
Synthesis of Large Dynamic Concurrent Programs from Dynamic Specifications
inferred← citeshttps://doi.org/10.48550/arxiv.1911.03807openalex-snapshot
Synthesis of coordination programs from linear temporal logic
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.