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

DOI10.1016/J.TCS.2008.04.007zbMATH Open1151.68040OpenAlexW2101766761MaRDI QIDQ953553FDOQ953553

Authors: 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

Recommendations

• The decidability of the structural congruence for beta-binders
• On Beta-Binders Communications
• Computational Methods in Systems Biology
• A static analysis for beta-binders
• A translation of beta-binders in a prioritized pi-calculus

zbMATH Keywords

complexitydecidabilityprocess calculistructural congruence

Mathematics Subject Classification ID

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

Cites Work

• BioAmbients: an abstraction for biological compartments
• Title not available (Why is that?)
• Brane Calculi
• Computational Methods in Systems Biology
• Communicating sequential processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Application of a stochastic name-passing calculus to representation and simulation of molecular processes
• A new natural structural congruence in the pi-calculus with replication
• Multisets and structural congruence of the pi-calculus with replication
• A multiset semantics for the pi-calculus with replication
• The decidability of the structural congruence for beta-binders
• Transactions on Computational Systems Biology I

Cited In (4)

• The decidability of the structural congruence for beta-binders
• On the computational power of BlenX
• On Beta-Binders Communications
• Transactions on Computational Systems Biology I

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953553)