On the public citation graph

Concurrency, automata and domains

https://doi.org/10.1007/bfb0032032
0 signed · 39 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.1007/3-540-08860-1_7openalex-snapshot
Stable models of typed λ-calculi
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-17906-2_31openalex-snapshot
Event structures
inferredcites →https://doi.org/10.1007/3-540-19020-1_18openalex-snapshot
dI-domains as a model of polymorphism
inferredcites →https://doi.org/10.1007/3-540-19488-6_133openalex-snapshot
Computations, residuals, and the power of indeterminacy
inferredcites →https://doi.org/10.1007/978-1-4612-0317-9openalex-snapshot
Categorical Combinators, Sequential Algorithms, and Functional Programming
inferredcites →https://doi.org/10.1007/bfb0012801openalex-snapshot
Domains for denotational semantics
inferredcites →https://doi.org/10.1007/bfb0018344openalex-snapshot
Compositional relational semantics for indeterminate dataflow networks
inferredcites →https://doi.org/10.1007/bfb0035798openalex-snapshot
DI-domains as information systems
inferredcites →https://doi.org/10.1007/bfb0040254openalex-snapshot
Connections between a concrete and an abstract model of concurrent systems
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1016/0304-3975(88)90051-5openalex-snapshot
Theory of traces
inferredcites →https://doi.org/10.1016/0304-3975(89)90050-9openalex-snapshot
Concurrent transition systems
inferredcites →https://doi.org/10.1016/0304-3975(89)90117-5openalex-snapshot
Event structures and domains
inferredcites →https://doi.org/10.1016/0890-5401(89)90065-5openalex-snapshot
Recursive domain equations for concrete data structures
inferredcites →https://doi.org/10.1109/lics.1990.113730openalex-snapshot
Universal domains in the theory of denotational semantics of programming languages
inferredcites →https://doi.org/10.1145/322108.322122openalex-snapshot
Minimal and Optimal Computations of Recursive Programs
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.3233/fi-1988-11406openalex-snapshot
A Non-Interleaving Semantics for CCS Based on Proved Transitions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1996.0039openalex-snapshot
Aperiodic Languages in Concurrency Monoids
inferred← citeshttps://doi.org/10.1007/11549345_59openalex-snapshot
Concurrent Automata vs. Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_12openalex-snapshot
On Recognizable Stable Trace Languages
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_111openalex-snapshot
From domains to automata with concurrency
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_84openalex-snapshot
A kleene theorem for recognizable languages over concurrency monoids
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_97openalex-snapshot
Dependence orders for computations of concurrent automata
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_41openalex-snapshot
Languages and logical definability in concurrency monoids
inferred← citeshttps://doi.org/10.1007/978-3-319-77935-5_21openalex-snapshot
Certified Foata Normalization for Generalized Traces
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_7openalex-snapshot
Semantics of Deterministic Shared-Memory Systems
inferred← citeshttps://doi.org/10.1007/bfb0017483openalex-snapshot
Nondeterministic automata with concurrency relations and domains
inferred← citeshttps://doi.org/10.1007/s11334-019-00347-1openalex-snapshot
Certified normalization of generalized traces
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90054-jopenalex-snapshot
Defining conditional independence using collapses
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90247-qopenalex-snapshot
The poset of infinitary traces
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00030-1openalex-snapshot
Labelled domains and automata with concurrency
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00266-lopenalex-snapshot
Recognizable languages in concurrency monoids
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00012-6openalex-snapshot
Representation of computations in concurrent automata by dependence orders
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00299-5openalex-snapshot
Stable trace automata vs. full trace automata
inferred← citeshttps://doi.org/10.1142/s021819679800017xopenalex-snapshot
Topology for Computations of Concurrent Automata
inferred← citeshttps://doi.org/10.3233/fi-2014-1067openalex-snapshot
A Domain View of Timed Behaviors
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.