The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
A multiset semantics for the pi-calculus with replication
Theoretical Computer Science - Special volume on Petri nets
Multisets and structural congruence of the pi-calculus with replication
Theoretical Computer Science
Information Processing Letters
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Beta binders for biological interactions
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Operational patterns in beta-binders
Transactions on Computational Systems Biology I
On the decidability and complexity of the structural congruence for beta-binders
Theoretical Computer Science
The BlenX Language with Biological Transactions
Transactions on Computational Systems Biology IX
Hi-index | 0.00 |
Beta-binders is a recent process algebra developed for modeling and simulating biological systems. As usual for process calculi, the semantic definition heavily relies on a structural congruence. The treatment of the structural congruence is essential for implementation. The proof of the decidability of this congruence, reported in this paper, is a first step towards implementations.