On the public citation graph
A fair calculus of communicating systems
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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
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-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/bf00289140openalex-snapshot
Axiomatising finite delay operators
inferredcites →https://doi.org/10.1007/bfb0012788openalex-snapshot
A powerdomain for countable non-determinism
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/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
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/11560647_36openalex-snapshot
Using Fairness Constraints in Process-Algebraic Verification
inferred← citeshttps://doi.org/10.1007/11817949_10openalex-snapshot
Checking a Mutex Algorithm in a Process Algebra with Fairness
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_174openalex-snapshot
Communication with concurrent systems via I/0-procedures
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/3-540-50241-6_39openalex-snapshot
Deciding the path- and word-fair equivalence problem
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_29openalex-snapshot
Relating Fairness and Timing in Process Algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_20openalex-snapshot
Time and Fairness in a Process Algebra with Non-blocking Reading
inferred← citeshttps://doi.org/10.1007/bfb0019439openalex-snapshot
The structure and semantics of actor languages
inferred← citeshttps://doi.org/10.1007/bfb0039621openalex-snapshot
Some results on fairness: The regular case
inferred← citeshttps://doi.org/10.1007/s00236-006-0011-2openalex-snapshot
Fairness of Actions in System Computations
inferred← citeshttps://doi.org/10.1007/s00236-009-0092-9openalex-snapshot
Liveness of a mutex algorithm in a fair process algebra
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90012-0openalex-snapshot
Modal logics for communicating systems
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90126-5openalex-snapshot
An introduction to the regular theory of fairness
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90013-7openalex-snapshot
Weak and strong fairness in CCS
inferred← citeshttps://doi.org/10.1016/0950-5849(89)90159-6openalex-snapshot
Survey of fairness notions
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.11.027openalex-snapshot
Fairness of Components in System Computations
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.01.004openalex-snapshot
Keep it fair: Equivalence and composition
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.100480openalex-snapshot
Ensuring liveness properties of distributed systems: Open problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.02.011openalex-snapshot
Fairness of components in system computations
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80025-5openalex-snapshot
The power of the future perfect in program logics
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00076-5openalex-snapshot
A fixpoint approach to finite delay and fairness
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00047-7openalex-snapshot
An Actor Rewriting Theory
inferred← citeshttps://doi.org/10.1109/lics.1991.151662openalex-snapshot
On the relationship between process algebra and input/output automata
inferred← citeshttps://doi.org/10.2168/lmcs-5(2:15)2009openalex-snapshot
Explicit fairness in testing semantics
inferred← citeshttps://doi.org/10.4204/eptcs.54.4openalex-snapshot
Automated Analysis of MUTEX Algorithms with FASE
inferred← citeshttps://doi.org/10.4204/eptcs.64.3openalex-snapshot
Read Operators and their Expressiveness in Process Algebras
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.