On the public citation graph

Compositional proofs by partial specification of processes

0 signed · 23 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-18088-5_11openalex-snapshot
Verifying a protocol using relativized bisimulation
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0304-3975(85)90093-3openalex-snapshot
Higher-level synchronising devices in Meije-SCCS
inferredcites →https://doi.org/10.1109/lics.1988.5119openalex-snapshot
A modal process logic
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications

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-51237-3_14openalex-snapshot
The use of static constructs in a model process logic
inferred← citeshttps://doi.org/10.1007/3-540-51285-3_54openalex-snapshot
The expressive power of simple parallelism
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_29openalex-snapshot
Generating diagnostic information for behavioral preorders
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_95openalex-snapshot
Property preserving abstractions under parallel composition
inferred← citeshttps://doi.org/10.1007/3-540-56883-2_8openalex-snapshot
Analyzing concurrent systems using the Concurrency Workbench
inferred← citeshttps://doi.org/10.1007/978-3-319-63121-9_21openalex-snapshot
Modal Stochastic Games
inferred← citeshttps://doi.org/10.1007/bf01211911openalex-snapshot
Compositional minimisation of finite state systems using interface specifications
inferred← citeshttps://doi.org/10.1007/bfb0023732openalex-snapshot
Compositional minimization of finite state systems
inferred← citeshttps://doi.org/10.1007/bfb0039057openalex-snapshot
A preorder for partial process specifications
inferred← citeshttps://doi.org/10.1007/s004460050010openalex-snapshot
Generating diagnostic information for behavioral preorders
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90048-mopenalex-snapshot
Bisimulation and divergence
inferred← citeshttps://doi.org/10.1017/s0960129511000697openalex-snapshot
Extending modal transition systems with structured labels
inferred← citeshttps://doi.org/10.1109/lics.1988.5117openalex-snapshot
Bisimulations and divergence
inferred← citeshttps://doi.org/10.1109/lics.1988.5119openalex-snapshot
A modal process logic
inferred← citeshttps://doi.org/10.1109/lics.1990.113768openalex-snapshot
When is 'partial' adequate? A logic-based proof technique using partial specifications
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.