On the public citation graph

An algebra for process creation

https://doi.org/10.1007/bf01178776
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.
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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-17906-2_31openalex-snapshot
Event structures
inferredcites →https://doi.org/10.1007/3-540-18086-9_27openalex-snapshot
Operational Petri net semantics for CCSP
inferredcites →https://doi.org/10.1007/3-540-18625-5_49openalex-snapshot
Merge and termination in process algebra
inferredcites →https://doi.org/10.1007/3-540-52559-9_68openalex-snapshot
Refinement of actions in causality based models
inferredcites →https://doi.org/10.1007/bf02915446openalex-snapshot
A distributed operational semantics for CCS based on condition/event systems
inferredcites →https://doi.org/10.1007/bfb0015049openalex-snapshot
Modular specifications in process algebra
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0039069openalex-snapshot
Transition system specifications with negative premises
inferredcites →https://doi.org/10.1007/bfb0039617openalex-snapshot
Bounded nondeterminism and the approximation induction principle in process algebra
inferredcites →https://doi.org/10.1016/0141-9331(86)90196-1openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0304-3975(84)90067-7openalex-snapshot
Algèbre de processus et synchronisation
inferredcites →https://doi.org/10.1016/0304-3975(85)90093-3openalex-snapshot
Higher-level synchronising devices in Meije-SCCS
inferredcites →https://doi.org/10.1016/0304-3975(88)90048-5openalex-snapshot
Designing equivalent semantic models for process creation
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/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1017/cbo9780511608841.006openalex-snapshot
A process creation mechanism in process algebra
inferredcites →https://doi.org/10.1017/cbo9780511608841.007openalex-snapshot
Correctness proofs for systolic algorithms: palindromes and sorting
inferredcites →https://doi.org/10.1017/cbo9780511608841.010openalex-snapshot
Process algebra semantics of POOL
inferredcites →https://doi.org/10.1145/77600.77621openalex-snapshot
Module algebra
inferredcites →https://doi.org/10.1147/rd.315.0556openalex-snapshot
A CCS semantics for NIL

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-56596-5_49openalex-snapshot
Expressiveness results for process algebras
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_33openalex-snapshot
A congruence theorem for structured operational semantics with predicates
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_172openalex-snapshot
Transition system specifications in stalk format with bisimulation as a congruence
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_151openalex-snapshot
Towards a semantic theory of CML
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_9openalex-snapshot
An Observational Semantics for Linda
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_1openalex-snapshot
Non-finite Axiomatisability Results via Reductions: CSP Parallel Composition and CCS Restriction
inferred← citeshttps://doi.org/10.1007/978-3-319-27810-0_16openalex-snapshot
Rule Formats for Bounded Nondeterminism in Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-47166-2_40openalex-snapshot
A Calculus for Open Ensembles and Their Composition
inferred← citeshttps://doi.org/10.1007/bfb0015012openalex-snapshot
Weak sequential composition in process algebras
inferred← citeshttps://doi.org/10.1007/s00224-018-9873-2openalex-snapshot
Process Algebra with Strategic Interleaving
inferred← citeshttps://doi.org/10.1007/s002360000041openalex-snapshot
Refinement of actions and equivalence notions for concurrent systems
inferred← citeshttps://doi.org/10.1016/b978-0-44-321515-5.00021-4openalex-snapshot
Truly concurrent process algebra
inferred← citeshttps://doi.org/10.1016/b978-0-44-321515-5.00043-3openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00049-8openalex-snapshot
A behavioural theory of first-order CML
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80471-2openalex-snapshot
Process Creation and Full Sequential Composition in a Name-Passing Calculus
inferred← citeshttps://doi.org/10.1017/s0956796898003165openalex-snapshot
A theory of weak bisimulation for Core CML
inferred← citeshttps://doi.org/10.1017/s0960129511000417openalex-snapshot
Proving the validity of equations in GSOS languages using rule-matching bisimilarity
inferred← citeshttps://doi.org/10.1109/lics.1992.185526openalex-snapshot
Turning SOS rules into equations
inferred← citeshttps://doi.org/10.1145/232627.232649openalex-snapshot
A theory of weak bisimulation for core CML
inferred← citeshttps://doi.org/10.1145/232629.232649openalex-snapshot
A theory of weak bisimulation for core CML
inferred← citeshttps://doi.org/10.4204/eptcs.18.1openalex-snapshot
A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages
inferred← citeshttps://doi.org/10.4230/lipics.csl.2017.25openalex-snapshot
Precongruence Formats with Lookahead through Modal Decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.2104.05438openalex-snapshot
Actors -- A Process Algebra Based Approach
inferred← citeshttps://doi.org/10.7561/sacs.2020.2.205openalex-snapshot
Probabilistic Process Algebra and Strategic Interleaving
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.