On the public citation graph
On control of systems modelled as deterministic Rabin automata
0 signed · 54 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-15648-8_7openalex-snapshot
Automata, tableaux, and 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_29openalex-snapshot
Solving Sequential Conditions by Finite-State Strategies
inferredcites →https://doi.org/10.1007/bfb0023741openalex-snapshot
Synthesizing processes and schedulers from temporal specifications
inferredcites →https://doi.org/10.1007/bfb0023782openalex-snapshot
Control of ω-automata, Church's problem, and the emptiness problem for tree ω-automata
inferredcites →https://doi.org/10.1007/bfb0033527openalex-snapshot
Logical aspects of control of discrete-event systems: A survey of tools and techniques
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.1007/bfb0042302openalex-snapshot
Reducibility in analysis of coordination
inferredcites →https://doi.org/10.1016/0168-0072(91)90066-uopenalex-snapshot
Verification of concurrent programs: the automata-theoretic framework*
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
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(66)80013-xopenalex-snapshot
Testing and generating infinite sequences by a finite automaton
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-9904-1968-12122-6openalex-snapshot
Decidability of second-order theories and automata on infinite trees
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
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/5.21072openalex-snapshot
The control of discrete event systems
inferredcites →https://doi.org/10.1109/9.182487openalex-snapshot
On supervisory control of sequential behaviors
inferredcites →https://doi.org/10.1109/9.250509openalex-snapshot
Smart cars on smart roads: problems of control
inferredcites →https://doi.org/10.1109/9.8645openalex-snapshot
Some tractable supervisory control problems for discrete-event systems modeled by Buchi automata
inferredcites →https://doi.org/10.1109/cdc.1988.194301openalex-snapshot
Mutual exclusion problems for discrete event systems with shared events
inferredcites →https://doi.org/10.1109/cdc.1992.371185openalex-snapshot
Controllability subsets of live Rabin automata
inferredcites →https://doi.org/10.1109/sfcs.1988.21948openalex-snapshot
On the complexity of omega -automata
inferredcites →https://doi.org/10.1109/swat.1972.28openalex-snapshot
The emptiness problem for automata on infinite trees
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1137/0325013openalex-snapshot
Supervisory Control of a Class of Discrete Event Processes
inferredcites →https://doi.org/10.1137/s0363012991217524openalex-snapshot
Supervision of Infinite Behavior of Discrete-Event Systems
inferredcites →https://doi.org/10.1137/s0363012991217536openalex-snapshot
Control of Infinite Behavior of Finite Automata
inferredcites →https://doi.org/10.1145/12130.12159openalex-snapshot
Reasoning about fair concurrent programs
inferredcites →https://doi.org/10.1145/75277.75293openalex-snapshot
On the synthesis of a reactive module
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.23919/acc.1992.4792656openalex-snapshot
Control of Discrete Event Systems Modeled with Deterministic Buchi Automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-36390-4_3openalex-snapshot
Submodule Construction and Supervisory Control: A Generalization
inferred← citeshttps://doi.org/10.1007/978-1-4471-4276-8_3openalex-snapshot
Supervisory Control with Complete Observations
inferred← citeshttps://doi.org/10.1007/978-1-4615-4493-7_37openalex-snapshot
Fair Control of ω-Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_10openalex-snapshot
Scaling GR(1) Synthesis via a Compositional Frameworkfor LTL Discrete Event Control
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/bfb0020969openalex-snapshot
Refinements of approximating automata for synthesis of supervisory controllers for hybrid systems
inferred← citeshttps://doi.org/10.1007/s10626-011-0127-6openalex-snapshot
Using logic to solve the submodule construction problem
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-019-00299-5openalex-snapshot
On the relation between reactive synthesis and supervisory control of non-terminating processes
inferred← citeshttps://doi.org/10.1016/0895-7177(96)00063-5openalex-snapshot
Supervisory control of discrete event systems
inferred← citeshttps://doi.org/10.1016/s0167-6911(97)00106-0openalex-snapshot
Control of ω-automata under state fairness assumptions
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)42028-3openalex-snapshot
Supervisor Synthesis for Discrete Event Systems with Finite and Infinite Specifications
inferred← citeshttps://doi.org/10.1109/9.746270openalex-snapshot
Robustness of supervisors for discrete-event systems
inferred← citeshttps://doi.org/10.1109/access.2022.3183198openalex-snapshot
Supremal Marker-Controllable Subformula of a Given Canonical Temporal-Safety Formula
inferred← citeshttps://doi.org/10.1109/cdc.1996.572972openalex-snapshot
Design of robust supervisors for discrete event systems with infinite behaviors
inferred← citeshttps://doi.org/10.1109/etfa.2015.7301520openalex-snapshot
Optimal directed control of discrete event systems with linear temporal logic constraints
inferred← citeshttps://doi.org/10.1109/tac.2022.3143108openalex-snapshot
Supervisory Controller Synthesis for Nonterminating Processes Is an Obliging Game
inferred← citeshttps://doi.org/10.1137/060673862openalex-snapshot
Effective Control Synthesis for Partially Observed Discrete-Event Systems
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.