The Decidability of the Structural Congruence for Beta-binders

DOI10.1016/j.entcs.2007.05.014zbMath1277.68200OpenAlexW2030091233MaRDI QIDQ2864203

Corrado Priami, Alessandro Romanel

Publication date: 6 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.05.014

zbMATH Keywords

decidabilityprocess calculistructural congruence

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25) Systems biology, networks (92C42)

Related Items (5)

On Beta-Binders Communications ⋮ Communicating by compatibility ⋮ On the decidability and complexity of the structural congruence for beta-binders ⋮ Evolving BlenX programs to simulate the evolution of biological networks ⋮ On the computational power of BlenX

Cites Work

• Unnamed Item
• A multiset semantics for the pi-calculus with replication
• Multisets and structural congruence of the pi-calculus with replication
• Application of a stochastic name-passing calculus to representation and simulation of molecular processes
• BioAmbients: an abstraction for biological compartments
• A new natural structural congruence in the pi-calculus with replication
• Transactions on Computational Systems Biology I
• Brane Calculi
• Computational Methods in Systems Biology

This page was built for publication: The Decidability of the Structural Congruence for Beta-binders