A proof theoretic view of spatial and temporal dependencies in biochemical systems
From MaRDI portal
Publication:2628774
DOI10.1016/j.tcs.2016.03.029zbMath1344.68140OpenAlexW2325643235MaRDI QIDQ2628774
Moreno Falaschi, Davide Chiarugi, Carlos Olarte, Diana Hermith
Publication date: 15 July 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.03.029
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Biochemistry, molecular biology (92C40) Specification and verification (program logics, model checking, etc.) (68Q60) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items
On concurrent behaviors and focusing in linear logic, Slicing concurrent constraint programs, Process calculi for biological processes, A fresh view of linear logic as a logical framework, Hybrid and subexponential linear logics, A process algebraic approach to reaction systems, Hybrid linear logic, revisited, Non-associative, non-commutative multi-modal linear logic
Uses Software
Cites Work
- Proving concurrent constraint programming correct, revisited
- Linear logic
- Relating state-based and process-based concurrency through linear logic (full-version)
- P systems with minimal parallelism
- Subexponential concurrent constraint programming
- Evolving BlenX programs to simulate the evolution of biological networks
- A guide to membrane computing.
- Linear concurrent constraint programming: Operational and phase semantics
- A spatial logic for concurrency. II
- BioAmbients: an abstraction for biological compartments
- A spatial logic for concurrency. I
- A control flow analysis for Beta-binders with and without static compartments
- Verification of spatial and temporal modalities in biochemical systems
- Uniform proofs as a foundation for logic programming
- Timed $$\pi $$-Calculus
- A General Proof System for Modalities in Concurrent Constraint Programming
- Computational Modeling and Verification of Signaling Pathways in Cancer
- A Proof Theoretic Study of Soft Concurrent Constraint Programming
- A Declarative View of Signaling Pathways
- From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
- Logic Programming with Focusing Proofs in Linear Logic
- Modelling Biological Compartments in Bio-PEPA
- Membrane Computing
- An Analysis for Proving Temporal Properties of Biological Systems
- Modeling Static Biological Compartments with Beta-binders
- A Logical Framework for Systems Biology
- Types for Proofs and Programs
- Computational Methods in Systems Biology
- Brane Calculi
- Computational Methods in Systems Biology
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item