On the public citation graph

On the observational semantics of fair parallelism

https://doi.org/10.1007/bfb0036905
0 signed · 33 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-09981-6_7openalex-snapshot
Processus non-sequentiels et leurs observations en univers non-centralise
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-10007-5_47openalex-snapshot
On the semantics of fair parallelism
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-11494-7_5openalex-snapshot
An enlarged definition and complete axiomatization of observational congruence of finite processes
inferredcites →https://doi.org/10.1007/bfb0022510openalex-snapshot
A term model for CCS
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0304-3975(84)90067-7openalex-snapshot
Algèbre de processus et synchronisation
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-15641-0_24openalex-snapshot
A formal proof system for infinitary rational expressions
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_52openalex-snapshot
On the semantics of concurrency: Partial orders and transition systems
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_54openalex-snapshot
A fully observational model for infinite behaviours of communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_9openalex-snapshot
Concurrency and computability
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_180openalex-snapshot
A survey of equivalence notions for net based systems
inferred← citeshttps://doi.org/10.1007/978-3-642-32784-1_10openalex-snapshot
From Transitions to Executions
inferred← citeshttps://doi.org/10.1007/978-3-642-82453-1_12openalex-snapshot
About Fair Asynchrony
inferred← citeshttps://doi.org/10.1007/978-3-642-82453-1_9openalex-snapshot
Notes on Algebraic Calculi of Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-82921-5_2openalex-snapshot
Distributed Systems, Partial Orderings of Events, and Event Structures
inferred← citeshttps://doi.org/10.1007/bf01388999openalex-snapshot
Partial ordering models for concurrency can be defined operationally
inferred← citeshttps://doi.org/10.1007/bfb0016222openalex-snapshot
Some equivalence notions for concurrent systems. An overview
inferred← citeshttps://doi.org/10.1007/bfb0028836openalex-snapshot
Partial ordering derivations for CCS
inferred← citeshttps://doi.org/10.1007/bfb0030305openalex-snapshot
Weak and strong fairness in CCS
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90079-6openalex-snapshot
Towards a formal proof system for ω-rational expressions
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90032-8openalex-snapshot
Concurrent histories: A basis for observing distributed systems
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90095-7openalex-snapshot
About fair asynchrony
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90045-9openalex-snapshot
Merging regular processes by means of fixed-point theory
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90004-1openalex-snapshot
An algebraic theory of fair asynchronous communicating processes
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90096-5openalex-snapshot
Concurrency and atomicity
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90095-yopenalex-snapshot
A partial ordering semantics for CCS
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90013-7openalex-snapshot
Weak and strong fairness in CCS
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/s0079-8169(04)80014-xopenalex-snapshot
References
inferred← citeshttps://doi.org/10.21236/ada561739openalex-snapshot
Labelled Execution Systems
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.