On the public citation graph

The step failure semantics

https://doi.org/10.1007/bfb0039618
0 signed · 32 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-09510-1_46openalex-snapshot
A formal semantics for concurrent systems
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-11160-3_6openalex-snapshot
On the algorithmic properties of concurrent programs
inferredcites →https://doi.org/10.1007/3-540-11981-7_17openalex-snapshot
An operational semantics for CSP
inferredcites →https://doi.org/10.1007/3-540-15670-4_14openalex-snapshot
An improved failures model for communicating processes
inferredcites →https://doi.org/10.1007/978-3-642-69968-9openalex-snapshot
Petri Nets
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_14openalex-snapshot
Behaviors of Processes and Synchronized Systems of Processes
inferredcites →https://doi.org/10.1007/bf00262973openalex-snapshot
Synchronized behaviours of processes and rational relations
inferredcites →https://doi.org/10.1007/bf00268075openalex-snapshot
Specification-oriented semantics for Communicating Processes
inferredcites →https://doi.org/10.1016/0022-0000(79)90006-0openalex-snapshot
Semantics of nondeterminism, concurrency, and communication
inferredcites →https://doi.org/10.1016/0167-6423(83)90013-8openalex-snapshot
Decomposition of distributed programs into communication-closed layers
inferredcites →https://doi.org/10.1016/0304-3975(83)90021-xopenalex-snapshot
Subset languages of Petri nets part I: The relationship to string languages and normal forms
inferredcites →https://doi.org/10.1016/0304-3975(83)90094-4openalex-snapshot
Subset languages of petri nets part II: Closure properties
inferredcites →https://doi.org/10.1016/0304-3975(84)90022-7openalex-snapshot
A linear-history semantics for languages for distributed programming
inferredcites →https://doi.org/10.1145/3318.3322openalex-snapshot
CIRCAL and the representation of communication, concurrency, and time
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.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes

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-18088-5_9openalex-snapshot
A timed failures model for extended communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_71openalex-snapshot
Equivalence notions for concurrent systems and refinement of actions
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_83openalex-snapshot
Pomset semantics for true concurrency with synchronization and recursion
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_13openalex-snapshot
Equivalences and refinement
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_55openalex-snapshot
The consistency of a noninterleaving and an interleaving model for full TCSP
inferred← citeshttps://doi.org/10.1007/bf00265151openalex-snapshot
Step failures semantics and a complete proof system
inferred← citeshttps://doi.org/10.1007/bf01178906openalex-snapshot
Concurrent testing of processes
inferred← citeshttps://doi.org/10.1007/bf01178923openalex-snapshot
The connection between an event structure semantics and an operational semantics forTCSP
inferred← citeshttps://doi.org/10.1007/bf01784023openalex-snapshot
Step semantics for “true” concurrency with recursion
inferred← citeshttps://doi.org/10.1007/bfb0084785openalex-snapshot
Concurrent testing of processes
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90096-5openalex-snapshot
Concurrency and atomicity
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90333-wopenalex-snapshot
Determinism → (event structure isomorphism = step sequence equivalence)
inferred← citeshttps://doi.org/10.1017/s0960129500000116openalex-snapshot
Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
inferred← citeshttps://doi.org/10.1145/76359.76369openalex-snapshot
Distributed bisimulations
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.