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

Authors:
A. Romanel;C. Priami
Affiliations:
CoSBi, Piazza Manci 17, I-38100 Povo, Trento, Italy and Dipartimento di Ingegneria e Scienza dellInformazione, Università degli Studi di Trento, Via Sommarive 14, I-38100 Povo, Trento, Italy;CoSBi, Piazza Manci 17, I-38100 Povo, Trento, Italy and Dipartimento di Ingegneria e Scienza dellInformazione, Università degli Studi di Trento, Via Sommarive 14, I-38100 Povo, Trento, Italy
Venue:
Theoretical Computer Science
Year:
2008

Citing 14
Cited 3

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
Communicating sequential processes

Communications of the ACM
Application of a stochastic name-passing calculus to representation and simulation of molecular processes

Information Processing Letters
Communication and Concurrency

Communication and Concurrency
A new natural structural congruence in the pi-calculus with replication

Acta Informatica
BioAmbients: an abstraction for biological compartments

Theoretical Computer Science - Special issue: Computational systems biology
The Decidability of the Structural Congruence for Beta-binders

Electronic Notes in Theoretical Computer Science (ENTCS)
BetaWB: modelling and simulating biological processes

Proceedings of the 2007 Summer Computer Simulation Conference
A formal and integrated framework to simulate evolution of biological pathways

CMSB'07 Proceedings of the 2007 international conference on Computational methods in systems biology
Beta binders for biological interactions

CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Brane calculi

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 computational power of BlenX

Theoretical Computer Science
Modelling self-assembly in BlenX

Transactions on Computational Systems Biology XII
A rule-based and imperative language for biochemical modeling and simulation

SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods

Quantified Score

Hi-index	5.23

Visualization

Abstract

Beta-binders is a recent process calculus developed for modelling 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. We present a subset of the calculus for which the structural congruence is decidable and a subset for which it is also efficiently solvable. The obtained results are a first step towards implementations.