Multisets and structural congruence of the pi-calculus with replication
From MaRDI portal
Publication:1274455
DOI10.1016/S0304-3975(97)00179-5zbMath0912.68125OpenAlexW2067097453MaRDI QIDQ1274455
Tjalling Gelsema, Joost Engelfriet
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00179-5
Related Items
Ideal Abstractions for Well-Structured Transition Systems, A spatial logic for concurrency. I, An exercise in structural congruence, On the Relationship between π-Calculus and Finite Place/Transition Petri Nets, SOS rule formats for idempotent terms and idempotent unary operators, A multiset semantics for the pi-calculus with replication, On the decidability and complexity of the structural congruence for beta-binders, Structural inclusion in the pi-calculus with replication, Synthesising CCS bisimulation using graph rewriting, A theory of structural stationarity in the \(\pi\)-calculus, Explicit fusions, The Decidability of the Structural Congruence for Beta-binders
Cites Work