On the public citation graph

Weak and strong fairness in CCS

https://doi.org/10.1007/bfb0030305
0 signed · 29 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-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-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/3-540-12689-9_96openalex-snapshot
A fair calculus of communicating systems
inferredcites →https://doi.org/10.1007/bf00265555openalex-snapshot
Fairness and related properties in transition systems ? a temporal logic to deal with fairness
inferredcites →https://doi.org/10.1007/bfb0030311openalex-snapshot
The power of the future perfect in program logics
inferredcites →https://doi.org/10.1007/bfb0036905openalex-snapshot
On the observational semantics of fair parallelism
inferredcites →https://doi.org/10.1016/0167-6423(83)90004-7openalex-snapshot
Proof rules and transformations dealing with fairness
inferredcites →https://doi.org/10.1016/s0019-9958(85)80025-5openalex-snapshot
The power of the future perfect in program logics
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness

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-12689-9_96openalex-snapshot
A fair calculus of communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_15openalex-snapshot
A metric characterization of fair computations in CCS
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_77openalex-snapshot
Full-commutation and fair-termination in equational (and combined) term-rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_14openalex-snapshot
Liveness and Fairness in Process-Algebraic Verification
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_31openalex-snapshot
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-72952-5_13openalex-snapshot
Pict Correctness Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-88194-0_4openalex-snapshot
Specifying and Verifying Event-Based Fairness Enhanced Systems
inferred← citeshttps://doi.org/10.1007/bf00271640openalex-snapshot
A fair calculus of communicating systems
inferred← citeshttps://doi.org/10.1007/bf01379186openalex-snapshot
An operational semantics for occam
inferred← citeshttps://doi.org/10.1007/bfb0013123openalex-snapshot
A characterization of fair computations of finite state SCCS processes
inferred← citeshttps://doi.org/10.1007/bfb0035859openalex-snapshot
An automaton characterization of fairness in SCCS
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90143-0openalex-snapshot
Deadlock and fairness in morphisms of transition systems
inferred← citeshttps://doi.org/10.1016/b978-0-444-89402-1.50048-5openalex-snapshot
Fairness in LOTOS
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.014openalex-snapshot
Pict correctness revisited
inferred← citeshttps://doi.org/10.1051/ita/1989230100591openalex-snapshot
Fairness and regularity for SCCS processes
inferred← citeshttps://doi.org/10.1051/ita/1989230100591/pdfopenalex-snapshot
Fairness and regularity for SCCS processes
inferred← citeshttps://doi.org/10.1109/lics.1991.151649openalex-snapshot
CCS with priority choice
inferred← citeshttps://doi.org/10.1147/rd.315.0556openalex-snapshot
A CCS semantics for NIL
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.