On the public citation graph
Using trace theory to model discrete events
0 signed · 19 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.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4612-3462-3_62openalex-snapshot
Discrete Event Systems and Deadlock
inferred← citeshttps://doi.org/10.1007/bf01797161openalex-snapshot
Locked discrete event systems: How to model and how to unlock
inferred← citeshttps://doi.org/10.1016/0167-6911(91)90061-iopenalex-snapshot
On controllability and normality of discrete event dynamical systems
inferred← citeshttps://doi.org/10.1016/b978-0-08-041263-4.50090-7openalex-snapshot
DISCRETE EVENT SYSTEMS: DEADLOCK, LIVELOCK, AND LIVEDEADLOCK
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)51969-2openalex-snapshot
Discrete Event Systems: Deadlock, Livelock, and Livedeadlock
inferred← citeshttps://doi.org/10.1023/a:1008271916548openalex-snapshot
A Survey of Petri Net Methods for Controlled Discrete Event Systems
inferred← citeshttps://doi.org/10.1080/00207729208949395openalex-snapshot
Discrete events and general systems theory
inferred← citeshttps://doi.org/10.1109/5.21072openalex-snapshot
The control of discrete event systems
inferred← citeshttps://doi.org/10.1109/9.250512openalex-snapshot
Predicates and predicate transformers for supervisory control of discrete event dynamical systems
inferred← citeshttps://doi.org/10.1109/9.545713openalex-snapshot
On asymptotically efficient solutions for a class of supervisory control problems
inferred← citeshttps://doi.org/10.1109/9.948485openalex-snapshot
Sequential control of trace processes
inferred← citeshttps://doi.org/10.1109/9.964683openalex-snapshot
Model matching for finite-state machines
inferred← citeshttps://doi.org/10.1109/90.298437openalex-snapshot
Automated repair of complex systems by fault compensation
inferred← citeshttps://doi.org/10.1109/cdc.1991.261263openalex-snapshot
Using predicate transformers for supervisory control
inferred← citeshttps://doi.org/10.1109/cdc.1994.411306openalex-snapshot
Model matching for finite state machines
inferred← citeshttps://doi.org/10.1109/ftdcs.1988.26697openalex-snapshot
A tool for the synthesis of discrete controllers for distributed 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.