The Decidability of the Structural Congruence for Beta-binders

Electronic Notes in Theoretical Computer Science

Volumn 171, Issue 2 SPEC. ISS., 2007, Pages 155-170

  Priami, Corrado ^a   Romanel, Alessandro ^a  

^a UNIVERSITY OF TRENTO   (Italy)

Author keywords

Decidability; Process Calculi; Structural Congruence

Indexed keywords

BIOLOGICAL SYSTEMS; COMPUTER SIMULATION; MATHEMATICAL MODELS; SEMANTIC WEB;

BETA-BINDERS; PROCESS CALCULI; STRUCTURAL CONGRUENCE;

ALGEBRA;

EID: 34250874478     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.05.014     Document Type: Article

References (16)

1. K.S. Booth and C.J. Colbourn. Problems polynomially equivalent to graph isomorphism. Technical Report CS-77-04, Department of Computer Science, University of Waterloo, Ontario, Canada, 1977
2. Cardelli L. Brane calculi. Proc. of Computational Methods in Systems Biology. LNCS volume 3082 (2005) 257-278
3. P. Degano, D. Prandi, C. Priami, and P. Quaglia. Beta-binders for biological quantitative experiments. In 4rd Int. Workshop on Quantitative Aspects of Programming Languages (QAPL 06), 2006. to appear
4. Engelfriet J. A multiset semantics for the pi-calculus with replication. Theor. Comput. Sci. 153 1&2 (1996) 65-94
5. Engelfriet J., and Gelsema T.E. Multisets and structural congruence of the pi-calculus with replication. Theor. Comput. Sci. 211 1-2 (1999) 311-337
6. J. Engelfriet and T.E. Gelsema. Structural congruence in the pi-calculus with potential replication. Technical Report 00-02, Leiden Institute of Advanced Computer Science, Leiden University, The Nederlands, 2000
7. J. Engelfriet and T.E. Gelsema. The decidability of structural congruence for replication restricted pi-calculus processes. Technical Report 04-07, Leiden Institute of Advanced Computer Science, Leiden University, The Nederlands, 2004
8. Engelfriet J., and Gelsema T.E. A new natural structural congruence in the pi-calculus with replication. Acta Inf. 40 6-7 (2004) 385-430
9. Gillespie D.T. A general method for numerically simulating the stochastic time evolution of coupled chemical reactions. J. Phys. Chem. 22 (1976) 403-434
10. Köbler J., Schöning U., and Torán J. The Graph Isomorphism Problem: its structural complexity (1993), Birkhäuser
11. R. Milner. The polyadic pi-calculus: a tutorial. Technical Report ECSLFCS-91-180, Computer Science Department, University of Edinburgh, UK, 1991
12. Priami C., and Quaglia P. Beta binders for biological interactions. Proc. of Computational Methods in Systems Biology. LNCS volume 3082 (2005) 20-33
13. Priami C., and Quaglia P. Operational patterns in beta-binders. T. Comp. Sys. Biology 1 (2005) 50-65
14. Priami C., Regev A., Shapiro E., and Silvermann W. Application of a stochastic name-passing calculus to representation and simulation of molecular processes. Inf. Process. Lett. 80 1 (2001) 25-31
15. Regev A., Panina E.M., Silverman W., Cardelli L., and Shapiro E. Bioambients: an abstraction for biological compartments. Theor. Comput. Sci. 325 1 (2004) 141-167
16. Regev A., and Shapiro E. Cells as computation (2002), Nature