Logical Analysis of Biological Systems

• Autorzy: Mardare R. , Priami C.
• Języki publikacji: EN

Abstrakty

EN

Our paper proposes a technique for performing logical analysis over the calculi for communication and mobility, i.e., Ambient Calculus type of calculi. We show how this analysis can be used in the case of biological models in order to obtain significant information for biologists. The technique is based on set theoretical models we developed for ambient processes by using the power of Hypersets Theory. These models are further used as possible worlds in a Kripke structure organized for a propositional branching temporal logic. Providing the temporal logical structure for the accessibility relation between ambient processes, we open the perspective of reusing model checking algorithms developed for temporal logics in analyzing any phenomena that can be described by these calculi.

Słowa kluczowe

EN

hypersets; process algebras; ambiet calculus; temporal logic; model checking

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2005
• Tom: Vol. 64, nr 1-4
• Strony: 275--289
• Opis fizyczny: Bibliogr. 28 poz.

Twórcy

autor

Mardare R.

• Department of Information and Communication Technology Trento University, Via Sommarive 14, I-38050 POVO, Trento (TN), Italy

autor

Priami C.

• Department of Information and Communication Technology Trento University, Via Sommarive 14, I-38050 POVO, Trento (TN), Italy

Bibliografia

• [1] HyTech: The HYbrid TECHnology Tool, http://www-cad.eecs.berkeley.edu/tah/HyTech/
• [2] NuSMV: A New Symbolic Model Checker, http://nusmv.irst.itc.it/.
• [3] Receptors Directly Activating Trimetric G Proteins, http://courses.washington.edu/conj/gprotein/trimericgp.htm.
• [4] The SMV System, http://www-2.cs.cmu.edu/modelcheck//smv.html.
• [5] VIS Homepage, http://www-cad.eecs.berkeley.edu/vis/.
• [6] P. Aczel Non-Well-Founded Sets, CLSI Lecture Notes Number 14 Stanford: CSLI Publication, 1988.
• [7] B. Alberts, A. Johnson, J. Lewis, M. Raff, K. Roberts, P. Walter, Molecular Biology of the Cell, Garland Publishing, Inc., 2002.
• [8] J. Barwise, L. Moss, Vicious Circles. On the Mathematics of Non-Wellfounded Phenomena, CLSI Lecture Notes Number 60 Stanford: CSLI Publication, 1996.
• [9] L. Cardelli, Brane Calculi, Electronic Notes in Theoretical Computer Science (to appear); available at http://www.luca.demon.co.uk/.
• [10] L. Cardelli, L. Caires, A Spatial Logic for Concurrency (Part I), Information and Computation, 186, 2 (2003), 194–235.
• [11] L. Cardelli, A.D. Gordon,Mobile Ambients, Theoretical Computer Science, 2000, 177–213.
• [12] L. Cardelli, A.D. Gordon, Anytime, Anywhere.Modal Logics forMobile Ambients, Proceedings of the 27th ACM Symposium on Principles of Programming Languages, 2000, 365–377.
• [13] L. Cardelli, A.D. Gordon, Ambient Logic, Mathematical Structures in Computer Science, to appear; available at http://www.luca.demon.co.uk/.
• [14] E. A. Emerson, Temporal and Modal Logic, Handbook of Theoretical Computer Science, Vol. B: Formal Models and Sematics, Elsevier, 1990, 995–1072.
• [15] D.M. Gabbay, A. Kurucz, F. Wolter, M. Zakharyaschev, Many-Dimensional Modal Logics: Theory and Applications, Studies in Logic and the Foundations of Mathematics, 148 (2003).
• [16] F. Honsell,M. Forti, Set Theory with Free Construction Principles, Annali Scuola Normale Superiore di Pisa, 1983.
• [17] R. Mardare, C. Priami, Computing the Accessibility Relation for Ambient Calculus, Dipartimento di Informatica e Tlc, University of Trento, 2003; available at http://www.dit.unitn.it following the link Publications.
• [18] R. Mardare, C. Priami, A Propositional Branching Temporal Logic for the Ambient Calculus, Dipartimento di Informatica e Tlc, University of Trento, 2003; available at http://www.dit.unitn.it following the link Publications.
• [19] R. Mardare, C. Priami, A Logical Spproach to security in the Context of Ambient Calculus, Electronic Notes in Computer Science (to appear).
• [20] R. Mardare, C. Priami, Model Checking Biological Systems Described Using Ambient Calculus, Electronic Notes in Computer Science, to appear.
• [21] R. Milner, A Calculus of Communicating Systems, LNCS 92, Springer-Verlag, 1980.
• [22] R. Milner, Communicating and Mobile Systems: the Pi-Calculus, Cambridge University Press, 1999.
• [23] R. Milner, O.H. Jensen, Bigraphs and Mobile Processes, Technical Report No 580, University of Cambridge, Computer Laboratory, 2004.
• [24] J. Parrow, An Introduction to π-Calculus, Handbook of Process Algebra, Elsevier, 2000.
• [25] Gh. Păun, Membrane Computing. An Introduction, Springer-Verlag, Berlin, 2002.
• [26] C. Priami, Stochastic _-Calculus, Comput. J., 6 (1995), 578–589.
• [27] C. Priami, A. Regev, E. Shapiro, W. Silverman, Application of Stochastic Name-Passing Calculus to Representation and Simulation of Molecular Processes, Information Processing Letters, 80 (2001), 25–31.
• [28] A. Regev, E.M. Panina, W. Silverman, L. Cardelli, E. Shapiro, BioAmbients: An Abstraction for Biological Compartments, Theoretical Computer Science (to appear); available at http://www.luca.demon.co.uk/.