On the public citation graph
Axiomatising finite delay operators
0 signed · 43 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/978-1-4612-6228-2openalex-snapshot
The Denotational Description of Programming Languages
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0036936openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0022-0000(84)90023-0openalex-snapshot
A complete inference system for a class of regular behaviours
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/s0019-9958(81)90082-6openalex-snapshot
A term model for synchronous processes
inferredcites →https://doi.org/10.1109/sfcs.1976.3openalex-snapshot
Algebraic families of interpretations
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
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.0047openalex-snapshot
Axiomatizing Prefix Iteration with Silent Steps
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_16openalex-snapshot
A complete modal proof system for a subset of SCCS
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-50517-2_90openalex-snapshot
McCarthy's amb cannot implement fair merge
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_19openalex-snapshot
Comparing linear and branching time temporal logics
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_14openalex-snapshot
CCS, liveness, and local model checking in the linear time mu-calculus
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-61455-2_10openalex-snapshot
Interaction Categories and the Foundations of Typed Concurrent Programming
inferred← citeshttps://doi.org/10.1007/bf00271640openalex-snapshot
A fair calculus of communicating systems
inferred← citeshttps://doi.org/10.1007/bf01178582openalex-snapshot
The expressive power of delay operators in SCCS
inferred← citeshttps://doi.org/10.1007/bfb0013123openalex-snapshot
A characterization of fair computations of finite state SCCS processes
inferred← citeshttps://doi.org/10.1007/bfb0014334openalex-snapshot
A categorical characterization of consistency results
inferred← citeshttps://doi.org/10.1007/bfb0035859openalex-snapshot
An automaton characterization of fairness in SCCS
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)90052-1openalex-snapshot
On the consistency of Koomen's Fair Abstraction Rule
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90013-7openalex-snapshot
Weak and strong fairness in CCS
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
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(00)00413-8openalex-snapshot
Non-regular iterators in process algebra
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00095-3openalex-snapshot
Semantics for finite delay
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.1017/s0960129503004006openalex-snapshot
Embedding untimed into timed process algebra: the case for explicit termination
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.3233/fi-1997-29302openalex-snapshot
HOW TO INTERPRET AND ESTABLISH CONSISTENCY RESULTS FOR SEMANTICS OF CONCURRENT PROGRAMMING LANGUAGES
inferred← citeshttps://doi.org/10.7146/brics.v2i5.19507openalex-snapshot
A Complete Equational Axiomatization for Prefix Iteration with Silent Steps
inferred← citeshttps://doi.org/10.7146/brics.v2i56.19957openalex-snapshot
Axiomatizing Prefix Iteration with Silent Steps
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.