On the public citation graph

Controllers for discrete event systems via morphisms

0 signed · 34 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1995.1134openalex-snapshot
Forward and Backward Simulations
inferredcites →https://doi.org/10.1006/inco.1996.0060openalex-snapshot
Forward and Backward Simulations
inferredcites →https://doi.org/10.1007/3-540-53982-4_21openalex-snapshot
On the complexity of equation solving in process algebra
inferredcites →https://doi.org/10.1007/3-540-60472-3_1openalex-snapshot
Symbolic controller synthesis for discrete and timed 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/978-1-4615-2217-1openalex-snapshot
Modeling and Control of Logical Discrete Event Systems
inferredcites →https://doi.org/10.1007/bf01797154openalex-snapshot
Hierarchical control of discrete-event systems
inferredcites →https://doi.org/10.1016/0167-6911(91)90061-iopenalex-snapshot
On controllability and normality of discrete event dynamical systems
inferredcites →https://doi.org/10.1016/0898-1221(82)90047-5openalex-snapshot
Elements of the theory of computation
inferredcites →https://doi.org/10.1023/a:1008210519960openalex-snapshot
Modular Control and Coordination of Discrete-Event Systems
inferredcites →https://doi.org/10.1109/5.21072openalex-snapshot
The control of discrete event systems
inferredcites →https://doi.org/10.1109/9.566659openalex-snapshot
Supervisory control using failure semantics and partial specifications
inferredcites →https://doi.org/10.1109/cdc.1994.411722openalex-snapshot
Supervisory control of nondeterministic systems under partial observation
inferredcites →https://doi.org/10.1109/lics.1990.113738openalex-snapshot
Equation solving using modal transition systems
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/75277.75293openalex-snapshot
On the synthesis of a reactive module
inferredcites →https://doi.org/10.2307/1994916openalex-snapshot
Solving Sequential Conditions by Finite-State Strategies
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.7146/brics.v1i12.21658openalex-snapshot
Models for Concurrency

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_26openalex-snapshot
Synthesis of Interface Automata
inferred← citeshttps://doi.org/10.1007/11590156_16openalex-snapshot
The MSO Theory of Connectedly Communicating Processes
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-46541-3_30openalex-snapshot
Hereditary History Preserving Bisimilarity Is Undecidable
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-319-23506-6_8openalex-snapshot
Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_21openalex-snapshot
Composition and Decomposition in True-Concurrency
inferred← citeshttps://doi.org/10.1007/s00165-007-0045-4openalex-snapshot
Interface synthesis and protocol conversion
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00307-8openalex-snapshot
Branching time controllers for discrete event systems
inferred← citeshttps://doi.org/10.1109/acac.2000.824326openalex-snapshot
Automated component adaptation by forced simulation
inferred← citeshttps://doi.org/10.1109/icvd.2000.812586openalex-snapshot
Automatic component matching using forced simulation
inferred← citeshttps://doi.org/10.1109/tcad.2012.2194491openalex-snapshot
Verifying Coalitions in 3-Party Systems
inferred← citeshttps://doi.org/10.1145/502175.502185openalex-snapshot
Forced simulation
inferred← citeshttps://doi.org/10.7146/brics.v6i1.19501openalex-snapshot
Hereditary History Preserving Simulation is Undecidable
inferred← citeshttps://doi.org/10.7146/brics.v6i19.20076openalex-snapshot
Hereditary History Preserving Bisimilarity is Undecidable
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.