Abstract
We propose a way of performing model checking analysis for biological systems. The technics were developed for a CTL* logic built upon Ambient Calculus.
We introduce labeled syntax trees for ambient processes and use them as possible worlds in a Kripke structure developed for a propositional branching temporal logic. The accessibility relation over labeled syntax trees is generated by the reduction over corresponding Ambient Calculus processes.
Providing the algorithms for calculating the accessibility relation between states, we open the perspective of using model checking algorithms developed for temporal logics in analyzing any phenomena described in Ambient Calculus.
Work partially supported by the FET project IST-2001-32072 DEGAS under the pro-active initiative on Global Computing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
HyTech: The HYbrid TECHnology Tool, http://www-cad.eecs.berkeley.edu/~tah/HyTech/
NuSMV: A new symbolic model checker, http://nusmv.irst.itc.it/
Receptors directly activating trimetric g proteins, http://courses.washington.edu/conj/gprotein/trimericgp.htm
The SMV system, http://www-2.cs.cmu.edu/~modelcheck/smv.html
VIS homepage, http://www-cad.eecs.berkeley.edu/~vis/
Alberts, B., Johnson, A., Lewis, J., Raff, M., Roberts, K., Walter, P.: Molecular Biology of the Cell, 4th edn., Garland Publishing, Inc. (2002)
Regev, A., Panina, E.M., Silverman, W., Cardelli, L., Shapiro, E.: Bioambients: An abstraction for biological compartments. Theoretical Computer Science (to appear, 2003), http://www.luca.demon.co.uk/
Barwise, J., Moss, L.: Vicious Circles. On the Mathematics of Non-Wellfounded Phenomena. In: CLSI Lecture Notes, vol. 60, CSLI Publication, Stanford (1996)
Cardelli, L.: Brane calculi, http://www.luca.demon.co.uk/
Cardelli, L., Caires, L.: A spatial logic for concurrency (part i). Information and Computation 186/2, 194–235 (2003)
Cardelli, L., Gordon, A.D.: Ambient logic. Mathematical Structures in Computer Science (to appear), http://www.luca.demon.co.uk/
Cardelli, L., Gordon, A.D.: Anytime, anywhere. modal logics for mobile ambients. In: Proceedings of the 27th ACM Symposium on Principles of Programming Languages, pp. 365–377 (2000)
Cardelli, L., Gordon, A.D.: Mobile ambients. In: Le Metayer, D. (ed.) Theoretical Computer Science, pp. 177–213 (June 2000) (Special Issue on Coordination)
Emerson, E.A.: Temporal and modal logic. In: Handbook of Theoretical Computer Science, B: Formal Models and Sematics, pp. 995–1072 (1990)
Mardare, R., Priami, C.: Computing the accessibility relation for ambient calculus. Technical report, Dipartimento di Informatica e Tlc, University of Trento (2003) (following the link Publications), Available at: http://www.dit.unitn.it
Mardare, R., Priami, C.: A propositional branching temporal logic for the ambient calculus. Technical report, Dipartimento di Informatica e Tlc, University of Trento (2003) (following the link Publications), Available at: http://www.dit.unitn.it
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mardare, R., Priami, C., Quaglia, P., Vagin, O. (2005). Model Checking Biological Systems Described Using Ambient Calculus. In: Danos, V., Schachter, V. (eds) Computational Methods in Systems Biology. CMSB 2004. Lecture Notes in Computer Science(), vol 3082. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25974-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-25974-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25375-4
Online ISBN: 978-3-540-25974-9
eBook Packages: Computer ScienceComputer Science (R0)