On the public citation graph
On sequential composition, action prefixes and process prefix
0 signed · 47 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.1006/inco.1993.1067openalex-snapshot
A Theory of Communicating Processes with Value Passing
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-16444-8_1openalex-snapshot
Verification of an alternating bit protocol by means of process algebra protocol
inferredcites →https://doi.org/10.1007/3-540-54430-5_80openalex-snapshot
Modal logics for mobile processes
inferredcites →https://doi.org/10.1007/3-540-57208-2_15openalex-snapshot
Proof systems for message-passing process algebras
inferredcites →https://doi.org/10.1007/978-3-642-77572-7_13openalex-snapshot
Process Algebra with Signals and Conditions
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_4openalex-snapshot
Notes on Communicating Sequential Systems
inferredcites →https://doi.org/10.1007/bf01221097openalex-snapshot
Process algebra with guards: Combining Hoare logic with process algebra
inferredcites →https://doi.org/10.1007/bf01642508openalex-snapshot
A proof system for communicating processes with value-passing
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1016/0167-6423(85)90010-3openalex-snapshot
Top-down design and the algebra of communicating processes
inferredcites →https://doi.org/10.1016/0304-3975(87)90123-xopenalex-snapshot
Algebraic specifications of computable and semicomputable data types
inferredcites →https://doi.org/10.1016/0304-3975(93)90156-nopenalex-snapshot
Modal logics for mobile processes
inferredcites →https://doi.org/10.1016/0890-5401(88)90027-2openalex-snapshot
Global renaming operators in concrete process algebra
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1016/s0019-9958(82)91250-5openalex-snapshot
Processes and the denotational semantics of concurrency
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1017/cbo9780511608841openalex-snapshot
Applications of Process Algebra
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
inferredcites →https://doi.org/10.1145/988071.988075openalex-snapshot
Some definitions for algebraic data type specifications
inferredcites →https://doi.org/10.1515/9783112733417-002openalex-snapshot
Verification of an alternating bit protocol by means of process algebra
inferredcites →https://doi.org/10.7146/dpb.v15i208.7559openalex-snapshot
A Calculus of Communicating Systems with Label Passing
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-60249-6_38openalex-snapshot
Discrete time process algebra with abstraction
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_34openalex-snapshot
Process Algebra with Partial Choice
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_8openalex-snapshot
Transmission Protocols for Instruction Streams
inferred← citeshttps://doi.org/10.1007/bfb0015026openalex-snapshot
Process algebra with partial choice
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.08.001openalex-snapshot
Revisiting sequential composition in process calculi
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00035-4openalex-snapshot
Grid protocols based on synchronous communication
inferred← citeshttps://doi.org/10.1016/s0168-0072(02)00082-9openalex-snapshot
On the expressiveness of choice quantification
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00117-3openalex-snapshot
Deadlock Behaviour in Split and ST Bisimulation Semantics
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82501-0openalex-snapshot
Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination
inferred← citeshttps://doi.org/10.1017/s0960129503004006openalex-snapshot
Embedding untimed into timed process algebra: the case for explicit termination
inferred← citeshttps://doi.org/10.1080/00207169708804599openalex-snapshot
Network algebra for asynchronous dataflow∗
inferred← citeshttps://doi.org/10.3233/fi-1997-291203openalex-snapshot
DISCRETE TIME PROCESS ALGEBRA: ABSOLUTE TIME, RELATIVE TIME AND PARAMETRIC TIME
inferred← citeshttps://doi.org/10.3233/fun-2006-712-302openalex-snapshot
Thread Algebra with Multi-Level Strategies
inferred← citeshttps://doi.org/10.7551/mitpress/5641.003.0026openalex-snapshot
Discrete Time Process Algebra with Silent Step
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.