On the public citation graph
Deterministic asynchronous automata for infinite traces
0 signed · 40 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.1006/inco.1993.1052openalex-snapshot
Asynchronous Mappings and Asynchronous Cellular Automata
inferredcites →https://doi.org/10.1007/3-540-51237-3_22openalex-snapshot
Safe executions of recognizable trace languages by asynchronous automata
inferredcites →https://doi.org/10.1007/3-540-54233-7_139openalex-snapshot
A Kleene theorem for infinite trace languages
inferredcites →https://doi.org/10.1007/3-540-55719-9_106openalex-snapshot
Asynchronous cellular automata for infinite traces
inferredcites →https://doi.org/10.1007/bfb0020790openalex-snapshot
Recognizable and rational languages of finite and infinite traces
inferredcites →https://doi.org/10.1007/bfb0020791openalex-snapshot
On the concatenation of infinite traces
inferredcites →https://doi.org/10.1007/bfb0079468openalex-snapshot
Problèmes combinatoires de commutation et réarrangements
inferredcites →https://doi.org/10.1016/0304-3975(85)90148-3openalex-snapshot
A syntactic congruence for rational ω-languages
inferredcites →https://doi.org/10.1016/0304-3975(93)90209-copenalex-snapshot
On the concatenation of infinite traces
inferredcites →https://doi.org/10.1016/0304-3975(93)90247-qopenalex-snapshot
The poset of infinitary traces
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.1051/ita/1985190100211openalex-snapshot
Automates et commutations partielles
inferredcites →https://doi.org/10.1051/ita/1987210200991openalex-snapshot
Notes on finite asynchronous automata
inferredcites →https://doi.org/10.7146/dpb.v6i78.7691openalex-snapshot
Concurrent Program Schemes and their Interpretations
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-36206-1_6openalex-snapshot
Local Normal Forms for Logics over Traces
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_55openalex-snapshot
Infinite Series-Parallel Posets: Logic and Languages
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_79openalex-snapshot
Complete and Tractable Local Linear Time Temporal Logics over Traces
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_40openalex-snapshot
A Further Step towards a Theory of Regular MSC Languages
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_67openalex-snapshot
Determinizing Büchi asynchronous automata
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_140openalex-snapshot
Linear time temporal logics over Mazurkiewicz traces
inferred← citeshttps://doi.org/10.1007/978-3-642-32621-9_5openalex-snapshot
On Distributed Monitoring of Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_8openalex-snapshot
Partial Commutation and Traces
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_12openalex-snapshot
Toward a Structure Theory of Regular Infinitary Trace Languages
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_15openalex-snapshot
Classifying Recognizable Infinitary Trace Languages Using Word Automata
inferred← citeshttps://doi.org/10.1007/bf01201811openalex-snapshot
Probabilistic Asynchronous Automata
inferred← citeshttps://doi.org/10.1007/bfb0014001openalex-snapshot
A hierarchy of partial order temporal properties
inferred← citeshttps://doi.org/10.1007/s11432-024-4869-5openalex-snapshot
A polynomial-time criterion for the stability of discrete iteration systems under deterministic asynchronous update
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00130-1openalex-snapshot
Logical definability on infinite traces
inferred← citeshttps://doi.org/10.1016/j.ic.2008.03.010openalex-snapshot
Muller message-passing automata and logics
inferred← citeshttps://doi.org/10.1016/j.ic.2017.04.006openalex-snapshot
Classifying recognizable infinitary trace languages using word automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114794openalex-snapshot
Process-commutative distributed objects: From cryptocurrencies to Byzantine-Fault-Tolerant CRDTs
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00117-xopenalex-snapshot
On the complementation of asynchronous cellular Büchi automata
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00123-8openalex-snapshot
Regular sets of infinite message sequence charts
inferred← citeshttps://doi.org/10.1142/s0129054198000192openalex-snapshot
RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA
inferred← citeshttps://doi.org/10.48550/arxiv.1208.2125openalex-snapshot
On distributed monitoring of asynchronous systems
inferred← citeshttps://doi.org/10.7146/brics.v2i58.19959openalex-snapshot
Determinizing Asynchronous Automata on Infinite Inputs
inferred← citeshttps://doi.org/10.7146/brics.v3i32.20012openalex-snapshot
Regular Trace Event Structures
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.