On the public citation graph
Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes
0 signed · 41 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-17943-7openalex-snapshot
PARLE Parallel Architectures and Languages Europe
inferredcites →https://doi.org/10.1007/3-540-18508-9openalex-snapshot
Category Theory and Computer Science
inferredcites →https://doi.org/10.1007/3-540-44618-4_19openalex-snapshot
Deriving Bisimulation Congruences for Reactive Systems
inferredcites →https://doi.org/10.1007/3-540-64299-4_36openalex-snapshot
An inductive view of graph transformation
inferredcites →https://doi.org/10.1007/978-3-540-30203-2_12openalex-snapshot
Adhesive High-Level Replacement Categories and Systems
inferredcites →https://doi.org/10.1007/978-3-540-31847-7_5openalex-snapshot
Graph Processes with Fusions: Concurrency by Colimits, Again
inferredcites →https://doi.org/10.1007/978-3-540-40018-9_4openalex-snapshot
Term Graph Rewriting for the π-Calculus
inferredcites →https://doi.org/10.1007/978-3-540-44616-3_24openalex-snapshot
Extraction of Structured Programs from Specification Proofs
inferredcites →https://doi.org/10.1007/978-3-642-04081-8openalex-snapshot
CONCUR 2009 -- concurrency theory : 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009 : proceedings
inferredcites →https://doi.org/10.1007/978-3-642-58041-3_6openalex-snapshot
The Polyadic π-Calculus: a Tutorial
inferredcites →https://doi.org/10.1007/b106390openalex-snapshot
Formal Methods in Software and Systems Modeling: essays dedicated to Hartmut Ehrig on the occasion of his 60th birthday
inferredcites →https://doi.org/10.1016/0304-3975(92)90185-iopenalex-snapshot
The chemical abstract machine
inferredcites →https://doi.org/10.1016/s0304-3975(00)00309-1openalex-snapshot
From rewrite rules to bisimulation congruences
inferredcites →https://doi.org/10.1016/s0304-3975(97)00179-5openalex-snapshot
Multisets and structural congruence of the pi-calculus with replication
inferredcites →https://doi.org/10.1016/s1571-0661(04)80957-5openalex-snapshot
A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi…
inferredcites →https://doi.org/10.1016/s1571-0661(05)80309-3openalex-snapshot
A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting
inferredcites →https://doi.org/10.1016/s1571-0661(05)80688-7openalex-snapshot
Premonoidal categories and flow graphs
inferredcites →https://doi.org/10.1023/a:1008647417502openalex-snapshot
An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories
inferredcites →https://doi.org/10.1051/ita:2005028openalex-snapshot
Adhesive and quasiadhesive categories
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1142/9789812384720openalex-snapshot
Handbook of Graph Grammars and Computing by Graph Transformation
inferredcites →https://doi.org/10.1142/9789812814951_0003openalex-snapshot
CONCURRENT SEMANTICS OF ALGEBRAIC GRAPH TRANSFORMATIONS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11841883_13openalex-snapshot
Process Bisimulation Via a Graphical Encoding
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_2openalex-snapshot
Ugo Montanari and Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_24openalex-snapshot
RPO, Second-Order Contexts, and λ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-87405-8_38openalex-snapshot
Abstract Semantics by Observable Contexts
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_40openalex-snapshot
Modelling and Verifying Mobile Systems Using π-Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-03429-9_9openalex-snapshot
Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_25openalex-snapshot
Efficient Bisimilarities from Second-Order Reaction Semantics for π-Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.04.016openalex-snapshot
Adhesive DPO Parallelism for Monic Matches
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.06.014openalex-snapshot
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
inferred← citeshttps://doi.org/10.1017/s096012950700610xopenalex-snapshot
Graph rewriting for the π-calculus
inferred← citeshttps://doi.org/10.1017/s0960129512000333openalex-snapshot
RPO semantics for mobile ambients
inferred← citeshttps://doi.org/10.2168/lmcs-5(3:6)2009openalex-snapshot
RPO, Second-order Contexts, and Lambda-calculus
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.