On the public citation graph

Structural operational specifications and trace automata

https://doi.org/10.1007/bfb0084799
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.
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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-15670-4_12openalex-snapshot
Categories of models for concurrency
inferredcites →https://doi.org/10.1007/3-540-53479-2_5openalex-snapshot
Three equivalent semantics for CCS
inferredcites →https://doi.org/10.1007/bfb0018344openalex-snapshot
Compositional relational semantics for indeterminate dataflow networks
inferredcites →https://doi.org/10.1007/bfb0032056openalex-snapshot
Compositionality through an operational semantics of contexts
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/0304-3975(89)90050-9openalex-snapshot
Concurrent transition systems
inferredcites →https://doi.org/10.3233/fi-1988-11406openalex-snapshot
A Non-Interleaving Semantics for CCS Based on Proved Transitions
inferredcites →https://doi.org/10.7146/dpb.v19i310.6701openalex-snapshot
Elementary transition systems

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.0077openalex-snapshot
CPO Models for Compact GSOS Languages
inferred← citeshttps://doi.org/10.1007/3-540-49366-2_11openalex-snapshot
Taxonomy and Expressiveness of Preemption: A Syntactic Approach
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_49openalex-snapshot
Expressiveness results for process algebras
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/978-3-662-04293-9_9openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90094-9openalex-snapshot
GSOS and finite labelled transition systems
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50033-3openalex-snapshot
Process Algebras with Localities
inferred← citeshttps://doi.org/10.1017/s0960129597002284openalex-snapshot
Structured transition systems with parametric observations: observational congruences and minimal realizations
inferred← citeshttps://doi.org/10.7146/brics.v6i30.20099openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.7146/dpb.v22i463.6936openalex-snapshot
Models for Concurrency
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.