On the public citation graph
Calculi for interaction
0 signed · 112 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-57182-5_7openalex-snapshot
Action calculi, or syntactic action structures
inferredcites →https://doi.org/10.1007/3-540-60218-6_9openalex-snapshot
Fibrational control structures
inferredcites →https://doi.org/10.1007/978-3-642-58041-3_6openalex-snapshot
The Polyadic π-Calculus: a Tutorial
inferredcites →https://doi.org/10.1007/bfb0057019openalex-snapshot
An object calculus for asynchronous communication
inferredcites →https://doi.org/10.1016/0167-6423(90)90044-eopenalex-snapshot
The gamma model and its discipline of programming
inferredcites →https://doi.org/10.1016/0304-3975(92)90185-iopenalex-snapshot
The chemical abstract machine
inferredcites →https://doi.org/10.1016/0304-3975(95)00074-7openalex-snapshot
On reduction-based process semantics
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1016/0890-5401(92)90009-5openalex-snapshot
A calculus of mobile processes, II
inferredcites →https://doi.org/10.1016/s1571-0661(04)80012-4openalex-snapshot
A Name-free Account of Action Calculi
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11548133_2openalex-snapshot
Labels from Reductions: Towards a General Theory
inferred← citeshttps://doi.org/10.1007/11596356_104openalex-snapshot
Information Flow Security for Interactive Systems
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_26openalex-snapshot
Deriving Bisimulation Congruences: 2-Categories Vs Precategories
inferred← citeshttps://doi.org/10.1007/3-540-44450-5_30openalex-snapshot
A General Framework for Types in Graph Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_19openalex-snapshot
Deriving Bisimulation Congruences for Reactive Systems
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_7openalex-snapshot
From Process Calculi to Process Frameworks
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_7openalex-snapshot
Observational Equivalence for Synchronized Graph Rewriting with Mobility
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-45523-x_15openalex-snapshot
The Linear Theory of Multiset Based Dynamic Systems
inferred← citeshttps://doi.org/10.1007/3-540-45832-8_3openalex-snapshot
Bigraphs as a Model for Mobile Interaction
inferred← citeshttps://doi.org/10.1007/3-540-48483-3_3openalex-snapshot
Normal Forms for Partitions and Relations
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_15openalex-snapshot
Logical Predicates for Intuitionistic Linear Type Theories
inferred← citeshttps://doi.org/10.1007/3-540-49253-4_6openalex-snapshot
A Linear Metalanguage for Concurrency
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_51openalex-snapshot
Elementary control structures
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_37openalex-snapshot
Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculi
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_159openalex-snapshot
Graphical calculi for interaction
inferred← citeshttps://doi.org/10.1007/978-3-032-02782-5_26openalex-snapshot
Towards a Unified Informatic Model for Cognitive Buildings: Integrating BIM, Actor Models, and Dynamic Fault Trees Using Bigraphical Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-08483-5_1openalex-snapshot
Addressing the Schema Representation Problem in Process Models Using Petri Nets—First Results Illustrated by the Dining Philosophers Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-40018-9_4openalex-snapshot
Term Graph Rewriting for the π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_33openalex-snapshot
Petri Nets, Discrete Physics, and Distributed Quantum Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-32784-1_11openalex-snapshot
Tracing the Man in the Middle in Monoidal Categories
inferred← citeshttps://doi.org/10.1007/978-3-642-34407-7_11openalex-snapshot
Hardware Design with Generalized Arrows
inferred← citeshttps://doi.org/10.1007/978-3-642-60085-2_3openalex-snapshot
Concurrent Logic/Constraint Programming: The Next 10 Years
inferred← citeshttps://doi.org/10.1007/978-81-322-1812-8_44-1openalex-snapshot
Terms and Automata Through Logic
inferred← citeshttps://doi.org/10.1007/978-81-322-2577-5_44openalex-snapshot
Terms and Automata Through Logic
inferred← citeshttps://doi.org/10.1007/978-981-99-2217-8_26openalex-snapshot
Actors@BIM: A Hybrid Formal Model for Cognitive Buildings
inferred← citeshttps://doi.org/10.1007/bfb0014545openalex-snapshot
Strong normalisation in higher-order action calculi
inferred← citeshttps://doi.org/10.1007/bfb0014569openalex-snapshot
Types and models for higher-order action calculi
inferred← citeshttps://doi.org/10.1007/bfb0028008openalex-snapshot
From action calculi to linear logic
inferred← citeshttps://doi.org/10.1007/bfb0053562openalex-snapshot
Verifiable and executable logic specifications of concurrent objects in $$\mathcal{L}_\pi$$
inferred← citeshttps://doi.org/10.1007/bfb0055094openalex-snapshot
Global/local subtyping and capability inference for a distributed π-calculus
inferred← citeshttps://doi.org/10.1007/bfb0055628openalex-snapshot
From rewrite to bisimulation congruences
inferred← citeshttps://doi.org/10.1007/s001650200015openalex-snapshot
Shallow Linear Action Graphs and their Embeddings
inferred← citeshttps://doi.org/10.1007/s00236-005-0180-4openalex-snapshot
A general framework for types in graph rewriting
inferred← citeshttps://doi.org/10.1007/s10485-019-09565-xopenalex-snapshot
Dynamical Systems and Sheaves
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50009-5openalex-snapshot
Concurrency Theory: A Historical Perspective on Coinduction and Process Calculi
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50026-6openalex-snapshot
An Introduction to the π-Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.09.004openalex-snapshot
Symmetric Monoidal Sketches and Categories of Wirings
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.03.029openalex-snapshot
Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.002openalex-snapshot
Bigraphs and Their Algebra
inferred← citeshttps://doi.org/10.1016/j.ic.2005.07.003openalex-snapshot
Pure bigraphs: Structure and dynamics
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.036openalex-snapshot
A brief history of process algebra
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.025openalex-snapshot
Locating reaction with 2-categories
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00309-1openalex-snapshot
From rewrite rules to bisimulation congruences
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00310-8openalex-snapshot
Minimality and separation results on asynchronous mobile processes – representability theorems by concurrent combinators
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00318-8openalex-snapshot
Normal forms for algebras of connections
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00362-0openalex-snapshot
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
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)00325-6openalex-snapshot
A generic type system for the Pi-calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00037-7openalex-snapshot
Variations on mobile processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80090-2openalex-snapshot
A Categorical and Graphical Treatment of Closure Conversion
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80500-0openalex-snapshot
A categorical framework for typing CCS-style process communication
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80910-1openalex-snapshot
Two-dimensional linear algebra
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80963-0openalex-snapshot
Pseudo-commutative Monads
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80367-6openalex-snapshot
Deriving Bisimulation Congruences: A 2-categorical Approach
inferred← citeshttps://doi.org/10.1017/s0960129504004311openalex-snapshot
Compositional semantics for open Petri nets based on deterministic processes
inferred← citeshttps://doi.org/10.1017/s0960129505004809openalex-snapshot
Axioms for bigraphical structure
inferred← citeshttps://doi.org/10.1017/s0960129506005664openalex-snapshot
Transition systems, link graphs and Petri nets
inferred← citeshttps://doi.org/10.1017/s096012951600027xopenalex-snapshot
The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics
inferred← citeshttps://doi.org/10.1017/s0960129599002947openalex-snapshot
Elementary structures in process theory (1): Sets with renaming
inferred← citeshttps://doi.org/10.1017/s1471068401000035openalex-snapshot
An interactive semantics of logic programming
inferred← citeshttps://doi.org/10.1093/oso/9780199204373.003.0004openalex-snapshot
Linguistic Side Effects
inferred← citeshttps://doi.org/10.1109/lics.1998.705654openalex-snapshot
The fusion calculus: expressiveness and symmetry in mobile processes
inferred← citeshttps://doi.org/10.1109/lics.1999.782620openalex-snapshot
Cartesian closed double categories, their lambda-notation, and the pi-calculus
inferred← citeshttps://doi.org/10.1109/smc.2019.8914360openalex-snapshot
Some issues in modelling comprehensive situation awareness
inferred← citeshttps://doi.org/10.1145/360204.360215openalex-snapshot
A generic type system for the Pi-calculus
inferred← citeshttps://doi.org/10.1145/373243.360215openalex-snapshot
A generic type system for the Pi-calculus
inferred← citeshttps://doi.org/10.14279/depositonce-2032openalex-snapshot
Behavioral Congruences and Verification of Graph Transformation Systems with Applications to Model Refactoring
inferred← citeshttps://doi.org/10.3390/axioms11010008openalex-snapshot
A Hypergraph Model for Communication Patterns
inferred← citeshttps://doi.org/10.4204/eptcs.292.3openalex-snapshot
From Linear Logic to Cyclic Sharing
inferred← citeshttps://doi.org/10.48456/tr-496openalex-snapshot
Contexts and embeddings for closed shallow action graphs
inferred← citeshttps://doi.org/10.48456/tr-523openalex-snapshot
Bigraphical reactive systems: basic theory
inferred← citeshttps://doi.org/10.48456/tr-580openalex-snapshot
Bigraphs and mobile processes (revised)
inferred← citeshttps://doi.org/10.48550/arxiv.1203.6324openalex-snapshot
Tracing the Man in the Middle in Monoidal Categories
inferred← citeshttps://doi.org/10.5860/choice.47-3212openalex-snapshot
The space and motion of communicating agents
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.