On the public citation graph

A theory of processes with localities

0 signed · 82 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-53479-2_10openalex-snapshot

Causal trees interleaving + causality

inferredcites →https://doi.org/10.1007/3-540-53479-2_13openalex-snapshot

Equivalences and refinement

inferredcites →https://doi.org/10.1007/3-540-54345-7_52openalex-snapshot

Observing localities

inferredcites →https://doi.org/10.1007/3-540-55511-0_19openalex-snapshot

On relating concurrency and nondeterminism

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

A parametric approach to localities

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

A static view of localities

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

Causal trees

inferredcites →https://doi.org/10.1016/0304-3975(85)90088-xopenalex-snapshot

Algebra of communicating processes with abstraction

inferredcites →https://doi.org/10.1137/0217063openalex-snapshot

Axiomatising Finite Concurrent Processes

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

Algebraic laws for nondeterminism and concurrency

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

Flowgraphs and Flow Algebras

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

Distributed bisimulations

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1998.2726openalex-snapshot

On Performance Congruences for Process Algebras

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

From Semantics to Spatial Distribution

inferred← citeshttps://doi.org/10.1007/3-540-45510-8_11openalex-snapshot

Mobile Processes: A Commented Bibliography

inferred← citeshttps://doi.org/10.1007/3-540-48523-6_31openalex-snapshot

Comparison of Process Algebra Equivalences Using Formats

inferred← citeshttps://doi.org/10.1007/3-540-49366-2_22openalex-snapshot

Mobile Computation: Calculus and Languages (A Tutorial)

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-57182-5_48openalex-snapshot

Observing located concurrency

inferred← citeshttps://doi.org/10.1007/3-540-57208-2_8openalex-snapshot

On the ill-timed but well-caused

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-59042-0_77openalex-snapshot

A fully abstract semantics for causality in the π-calculus

inferred← citeshttps://doi.org/10.1007/3-540-60084-1_113openalex-snapshot

Causality for mobile processes

inferred← citeshttps://doi.org/10.1007/3-540-60246-1_150openalex-snapshot

Performance preorder: Ordering processes with respect to speed

inferred← citeshttps://doi.org/10.1007/3-540-60688-2_41openalex-snapshot

Complexity as a basis for comparing semantic models of concurrency

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-61604-7_67openalex-snapshot

A calculus of mobile agents

inferred← citeshttps://doi.org/10.1007/3-540-62503-8_16openalex-snapshot

Analysis of Facile programs: A case study

inferred← citeshttps://doi.org/10.1007/3-540-62503-8_3openalex-snapshot

Abstract interpretation of the π-calculus

inferred← citeshttps://doi.org/10.1007/3-540-63165-8_203openalex-snapshot

Distributed processes and location failures

inferred← citeshttps://doi.org/10.1007/978-3-031-47963-2_21openalex-snapshot

Store Locally, Prove Globally

inferred← citeshttps://doi.org/10.1007/978-3-319-17112-8_4openalex-snapshot

A Formal Model of Client-Cloud Interaction

inferred← citeshttps://doi.org/10.1007/978-3-319-53733-7_3openalex-snapshot

A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus

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

Reversible Communicating Systems

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-75292-9_7openalex-snapshot

Bisimulations for a Distributed Higher Order π-Calculus

inferred← citeshttps://doi.org/10.1007/978-3-642-30767-6_17openalex-snapshot

A Fully Abstract View for Local Cause Semantics

inferred← citeshttps://doi.org/10.1007/978-3-642-36008-4_2openalex-snapshot

Formal Modeling of Mobile Computing Systems Based on Ambient Abstract State Machines

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/978-3-662-44920-2_15openalex-snapshot

An Ambient ASM Model of Client-to-Client Interaction via Cloud Computing and an Anonymously Accessible Docking Service

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

Comparing locality and causality based equivalences

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

Automatizing Parametric Reasoning on Distributed Concurrent Systems

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

True concurrency via abstract interpretation

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

‘Closed Interval Process Algebra’ versus ‘Interval Process Algebra’

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

Timing and causality in process algebra

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

Locality based semantics for process algebras

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

Performance preorder and competitive equivalence

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

A fully abstract semantics for causality in the $\pi$ -calculus

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

Causality for debugging mobile agents

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

Process algebra with action dependencies

inferred← citeshttps://doi.org/10.1007/s11704-018-7069-1openalex-snapshot

A fully abstract semantics for value-passing CCS for trees

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.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/j.jlamp.2019.100480openalex-snapshot

Ensuring liveness properties of distributed systems: Open problems

inferred← citeshttps://doi.org/10.1016/j.tcs.2019.06.028openalex-snapshot

A calculus of branching processes

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

Distributed processes and location failures

inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00011-7openalex-snapshot

Dynamic connectors for concurrency

inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00129-4openalex-snapshot

A format for semantic equivalence comparison

inferred← citeshttps://doi.org/10.1016/s0304-3975(99)80003-6openalex-snapshot

Non-interleaving semantics for mobile processes

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

Encoding Distributed Areas and Local Communication into the π-Calculus

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.1051/ita/1998324-600991openalex-snapshot

Towards parallelization of concurrent systems

inferred← citeshttps://doi.org/10.1109/iwssd.1996.501148openalex-snapshot

Relating CHAM descriptions of software architectures

inferred← citeshttps://doi.org/10.1109/lics.2013.45openalex-snapshot

A Compositional Semantics for the Reversible p-Calculus

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

Value-Passing CCS for Trees: A Theory for Concurrent Systems

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

Modeling and reasoning about wireless networks: A graph-based calculus approach

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

Enhanced operational semantics

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

Event-Based Mobility Modeling and Analysis

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

Authentication primitives and their compilation

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

Isolation Modeling and Analysis Based on Mobility

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

Enhanced operational semantics

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.4204/eptcs.368.1openalex-snapshot

Bisimulations Respecting Duration and Causality for the Non-interleaving Applied π-Calculus

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

Expansion Laws for Forward-Reverse, Forward, and Reverse Bisimilarities via Proved Encodings

inferred← citeshttps://doi.org/10.5555/857204.858268openalex-snapshot

Relating CHAM descriptions of software architectures

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.