On the decidability and complexity of the structural congruence for beta-binders

DOI10.1016/J.TCS.2008.04.007zbMath1151.68040OpenAlexW2101766761MaRDI QIDQ953553

Alessandro Romanel, Corrado Priami

Publication date: 6 November 2008

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

Full work available at URL: http://eprints.biblio.unitn.it/1697/1/TR%2D06%2D2006.pdf

zbMATH Keywords

complexitydecidabilityprocess calculistructural congruence

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

On the computational power of BlenX

Cites Work

• 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
• The Decidability of the Structural Congruence for Beta-binders
• Communicating sequential processes
• Transactions on Computational Systems Biology I
• Brane Calculi
• Computational Methods in Systems Biology
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the decidability and complexity of the structural congruence for beta-binders