On the public citation graph

Connections between a concrete and an abstract model of concurrent systems

https://doi.org/10.1007/bfb0040254
0 signed · 46 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-15641-0_26openalex-snapshot
Deterministic asynchronous automata
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/bfb0018344openalex-snapshot
Compositional relational semantics for indeterminate dataflow networks
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/0890-5401(89)90066-7openalex-snapshot
A proof of the Kahn principle for input/output automata
inferredcites →https://doi.org/10.1145/322108.322122openalex-snapshot
Minimal and Optimal Computations of Recursive Programs
inferredcites →https://doi.org/10.1145/41625.41643openalex-snapshot
Concurrent transition system semantics of process networks
inferredcites →https://doi.org/10.1145/96709.96743openalex-snapshot
On the relations computable by a class of concurrent automata
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.1006/inco.1998.2752openalex-snapshot
Context-Free Event Domains Are Recognizable
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-56596-5_27openalex-snapshot
Trace Nets
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-57787-4_21openalex-snapshot
On relating rewriting systems and graph grammars to event structures
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-60043-4_55openalex-snapshot
Context-free event domains are recognizable
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_45openalex-snapshot
The expressive power of indeterminate primitives in asynchronous computation
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/3-540-65306-6_22openalex-snapshot
Theory of regions
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_20openalex-snapshot
An Event-Based SOS for a Language with Refinement
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_7openalex-snapshot
Graphs for Generalized Traces
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_10openalex-snapshot
A Simple Generalization of Kahn’s Principle to Indeterminate Dataflow Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_47openalex-snapshot
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
inferred← citeshttps://doi.org/10.1007/bf01186645openalex-snapshot
Trace nets and process automata
inferred← citeshttps://doi.org/10.1007/bfb0013470openalex-snapshot
Dataflow networks are fibrations
inferred← citeshttps://doi.org/10.1007/bfb0017483openalex-snapshot
Nondeterministic automata with concurrency relations and domains
inferred← citeshttps://doi.org/10.1007/bfb0018344openalex-snapshot
Compositional relational semantics for indeterminate dataflow networks
inferred← citeshttps://doi.org/10.1007/bfb0032032openalex-snapshot
Concurrency, automata and domains
inferred← citeshttps://doi.org/10.1007/bfb0032041openalex-snapshot
Stability and sequentiality in dataflow networks
inferred← citeshttps://doi.org/10.1007/bfb0084797openalex-snapshot
Posets for configurations!
inferred← citeshttps://doi.org/10.1007/bfb0084799openalex-snapshot
Structural operational specifications and trace automata
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/j.entcs.2009.09.048openalex-snapshot
Automated Software Testing of Asynchronous Systems
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.1016/s1571-0661(05)80628-0openalex-snapshot
Hierarchy of Asynchronous Automata
inferred← citeshttps://doi.org/10.1023/a:1014305610452openalex-snapshot
From Petri Nets to Automata with Concurrency
inferred← citeshttps://doi.org/10.1109/lics.1992.185527openalex-snapshot
A calculus of dataflow networks
inferred← citeshttps://doi.org/10.1145/96709.96743openalex-snapshot
On the relations computable by a class of concurrent automata
inferred← citeshttps://doi.org/10.13140/rg.2.1.4346.5041openalex-snapshot
A Truly Concurrent Semantics for Processes sharing Quantified Resources
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.