On the public citation graph

Synchronisation trees

0 signed · 38 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-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-12920-0_13openalex-snapshot
A new definition of morphism on Petri nets
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_16openalex-snapshot
Communicating Sequential Processes
inferredcites →https://doi.org/10.1007/bfb0012800openalex-snapshot
Event structure semantics for CCS and related languages
inferredcites →https://doi.org/10.1007/bfb0012801openalex-snapshot
Domains for denotational semantics
inferredcites →https://doi.org/10.1007/bfb0022510openalex-snapshot
A term model for CCS
inferredcites →https://doi.org/10.1007/bfb0036899openalex-snapshot
On the relationship of CCS and CSP
inferredcites →https://doi.org/10.1016/0304-3975(81)90112-2openalex-snapshot
Petri nets, event structures and domains, part I

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-12920-0_13openalex-snapshot
A new definition of morphism on Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_1openalex-snapshot
On the axiomatic treatment of concurrency
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_12openalex-snapshot
Categories of models for concurrency
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_3openalex-snapshot
On the composition and decomposition of assertions
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_4openalex-snapshot
Process algebra with asynchronous communication mechanisms
inferred← citeshttps://doi.org/10.1007/3-540-16816-8_31openalex-snapshot
Free constructions of powerdomains
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_128openalex-snapshot
Category theory and models for parallel computation
inferred← citeshttps://doi.org/10.1007/3-540-18419-8_15openalex-snapshot
Universal models in categories for process synchronization
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_44openalex-snapshot
Retracing some paths in process algebra
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_20openalex-snapshot
Timed Process Algebra, Petri Nets, and Event Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-30793-5_11openalex-snapshot
Defining Distances for All Process Semantics
inferred← citeshttps://doi.org/10.1007/bfb0016226openalex-snapshot
Petri nets, morphisms and compositionality
inferred← citeshttps://doi.org/10.1007/bfb0040252openalex-snapshot
A generalized Kahn Principle for abstract asynchronous networks
inferred← citeshttps://doi.org/10.1007/s11047-024-09978-1openalex-snapshot
On categorical approach to reaction systems
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90088-xopenalex-snapshot
Algebra of communicating processes with abstraction
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90134-4openalex-snapshot
Un modèle asynchrone pour les systèmes distribués
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90032-0openalex-snapshot
Petri nets, algebras, morphisms, and compositionality
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90058-popenalex-snapshot
A compositional proof system on a category of labelled transition systems
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00247-xopenalex-snapshot
Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay
inferred← citeshttps://doi.org/10.1109/lics.1988.5113openalex-snapshot
A category of labelled Petri nets and compositional proof system
inferred← citeshttps://doi.org/10.1109/lics.1994.316076openalex-snapshot
A compositional proof system for the modal μ-calculus
inferred← citeshttps://doi.org/10.1137/0217073openalex-snapshot
Readies and Failures in the Algebra of Communicating Processes
inferred← citeshttps://doi.org/10.1145/3702981openalex-snapshot
Unifying Model Execution and Deductive Verification with Interaction Trees in Isabelle/HOL
inferred← citeshttps://doi.org/10.7146/brics.v1i34.21609openalex-snapshot
A Compositional Proof System for the Modal mu-Calculus
inferred← citeshttps://doi.org/10.7146/brics.v5i40.19485openalex-snapshot
A Compositional Proof System for the Modal mu-Calculus
inferred← citeshttps://doi.org/10.7146/brics.v6i14.20071openalex-snapshot
Weak Bisimulation and Open Maps
inferred← citeshttps://doi.org/10.7146/dpb.v22i463.6936openalex-snapshot
Models for Concurrency
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.