On the public citation graph

A static view of localities

0 signed · 50 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-54430-5_102openalex-snapshot

Distributed CCS

inferredcites →https://doi.org/10.1007/3-540-55719-9_109openalex-snapshot

A parametric approach to localities

inferredcites →https://doi.org/10.1007/3-540-55719-9_110openalex-snapshot

Proved trees

inferredcites →https://doi.org/10.1007/3-540-56496-9_4openalex-snapshot

Efficient local correctness checking

inferredcites →https://doi.org/10.1007/978-1-4471-3534-0_7openalex-snapshot

Winston: A Tool for Hierarchical Design and Simulation of Concurrent Systems

inferredcites →https://doi.org/10.1007/bfb0035764openalex-snapshot

Causal trees

inferredcites →https://doi.org/10.1007/bfb0084786openalex-snapshot

A theory of processes with localities

inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot

Communication and concurrency

inferredcites →https://doi.org/10.1016/0304-3975(93)90152-jopenalex-snapshot

Observing localities

inferredcites →https://doi.org/10.1016/0304-3975(93)90153-kopenalex-snapshot

Universal axioms for bisimulations

inferredcites →https://doi.org/10.1145/76359.76369openalex-snapshot

Distributed bisimulations

inferredcites →https://doi.org/10.3233/fi-1988-11406openalex-snapshot

A Non-Interleaving Semantics for CCS Based on Proved Transitions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10719839_42openalex-snapshot

From Semantics to Spatial Distribution

inferred← citeshttps://doi.org/10.1007/3-540-49727-7_10openalex-snapshot

Constructing Specific SOS Semantics for Concurrency via Abstract Interpretation

inferred← citeshttps://doi.org/10.1007/3-540-55599-4_129openalex-snapshot

Dynamic concurrent processes

inferred← citeshttps://doi.org/10.1007/3-540-56287-7_116openalex-snapshot

CCS, locations and asynchronous transition systems

inferred← citeshttps://doi.org/10.1007/3-540-56596-5_47openalex-snapshot

Some issues in the semantics of facile distributed programming

inferred← citeshttps://doi.org/10.1007/3-540-57182-5_24openalex-snapshot

Observing distribution in processes

inferred← citeshttps://doi.org/10.1007/3-540-57182-5_46openalex-snapshot

Proof systems for cause based equivalences

inferred← citeshttps://doi.org/10.1007/3-540-57887-0_107openalex-snapshot

Locality and true-concurrency in calculi for mobile processes

inferred← citeshttps://doi.org/10.1007/3-540-58201-0_65openalex-snapshot

Distribution and locality of concurrent systems

inferred← citeshttps://doi.org/10.1007/3-540-58715-2_126openalex-snapshot

Localities and failures (extended summary)

inferred← citeshttps://doi.org/10.1007/3-540-61055-3_42openalex-snapshot

Efficient minimization up to location equivalence

inferred← citeshttps://doi.org/10.1007/3-540-61363-3_25openalex-snapshot

Behavioural equivalence for infinite systems — Partially decidable!

inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_47openalex-snapshot

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra

inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_19openalex-snapshot

Fair Cooperative Multithreading

inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_7openalex-snapshot

Bisimulations for a Distributed Higher Order π-Calculus

inferred← citeshttps://doi.org/10.1007/978-3-642-39617-5_19openalex-snapshot

Distributed ECA Rules for Data Management Policies

inferred← citeshttps://doi.org/10.1007/bf01178730openalex-snapshot

Comparing locality and causality based equivalences

inferred← citeshttps://doi.org/10.1007/bf01221098openalex-snapshot

A theory of processes with localities

inferred← citeshttps://doi.org/10.1007/bf03259392openalex-snapshot

Automatizing Parametric Reasoning on Distributed Concurrent Systems

inferred← citeshttps://doi.org/10.1007/bfb0084786openalex-snapshot

A theory of processes with localities

inferred← citeshttps://doi.org/10.1007/s002360050086openalex-snapshot

Locality based semantics for process algebras

inferred← citeshttps://doi.org/10.1007/s002360100070openalex-snapshot

Process algebra with action dependencies

inferred← citeshttps://doi.org/10.1016/0304-3975(94)00219-9openalex-snapshot

Location equivalence in a parametric setting

inferred← citeshttps://doi.org/10.1016/0304-3975(95)00020-8openalex-snapshot

Locality and interleaving semantics in calculi for mobile processes

inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50033-3openalex-snapshot

Process Algebras with Localities

inferred← citeshttps://doi.org/10.1016/j.ic.2005.07.002openalex-snapshot

A theory of Stochastic systems. Part II: Process algebra

inferred← citeshttps://doi.org/10.1016/j.ic.2009.06.007openalex-snapshot

Typing termination in a higher-order concurrent imperative language

inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.11.005openalex-snapshot

Nested-unit Petri nets

inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.02.006openalex-snapshot

A stable non-interleaving early operational semantics for the pi-calculus

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00326-1openalex-snapshot

Distributed processes and location failures

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80298-1openalex-snapshot

Axiomatizing ST Bisimulation for a Process Algebra with Recursion and Action Refinement (Extended Abstract)

inferred← citeshttps://doi.org/10.1109/tase.2012.32openalex-snapshot

An Improved Full Abstraction Approach to Analyzing Locality Semantics

inferred← citeshttps://doi.org/10.1109/tse.2006.104openalex-snapshot

MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems

inferred← citeshttps://doi.org/10.1145/566385.566386openalex-snapshot

Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement

inferred← citeshttps://doi.org/10.4204/eptcs.255.2openalex-snapshot

Analysing Mutual Exclusion using Process Algebra with Signals

inferred← citeshttps://doi.org/10.7146/brics.v2i55.19956openalex-snapshot

Behavioural Equivalence for Infinite Systems—Partially Decidable!

inferred← citeshttps://doi.org/10.7146/brics.v5i6.19278openalex-snapshot

Further Results on Partial Order Equivalences on Infinite Systems

inferred← citeshttps://doi.org/10.7146/dpb.v21i395.6630openalex-snapshot

CCS, Locations and Asynchronous Transition Systems

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.