Unwinding biological systems

DOI10.1016/J.TCS.2015.02.045zbMATH Open1328.92027OpenAlexW2110571105MaRDI QIDQ2348024FDOQ2348024

Authors: Alberto Casagrande, Carla Piazza 

Publication date: 10 June 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11390/1070150

Recommendations

• Unwinding Possibilistic Security Properties
• scientific article; zbMATH DE number 1953033
• Unwinding Conditions for Security in Imperative Languages
• Verifying persistent security properties
• A proof system for information flow security

zbMATH Keywords

robustnesssystems biologybehavioural equivalencesunwinding

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Systems biology, networks (92C42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Bio-PEPA: A framework for the modelling and analysis of biological systems
• A theory of timed automata
• Formal molecular biology
• BioAmbients: an abstraction for biological compartments
• O-minimal hybrid systems.
• Approximating and computing behavioural distances in probabilistic transition systems
• Title not available (Why is that?)
• Brane Calculi
• Three Partition Refinement Algorithms
• Computational Methods in Systems Biology
• CCS expressions, finite state processes, and three problems of equivalence
• Title not available (Why is that?)
• Robustness of temporal logic specifications for continuous-time signals
• Dynamics of influenza virus and human host interactions during infection and replication cycle
• Title not available (Why is that?)
• Dynamically consistent reduction of logical regulatory graphs
• Title not available (Why is that?)
• Model decomposition and reduction tools for large-scale networks in systems biology
• Title not available (Why is that?)
• Some investigations concerning the CTMC and the ODE model derived from bio-PEPA
• Hybrid I/O automata.
• State equivalences for rectangular hybrid automata
• Lumpability abstractions of rule-based systems
• A semantic equivalence for Bio-PEPA based on discretisation of continuous values
• Title not available (Why is that?)
• Computer Aided Verification
• Title not available (Why is that?)
• Weighted lumpability on Markov chains
• Bitonal membrane systems: interactions of biological membranes
• Continuous valuations of temporal logic specifications with applications to parameter optimization and robustness measures
• Simulation and Bisimulation for Probabilistic Timed Automata
• Title not available (Why is that?)
• Robust satisfaction of temporal logic over real-valued signals
• Compositionality of approximate bisimulation for probabilistic systems
• Inclusion dynamics hybrid automata
• On-the-fly exact computation of bisimilarity distances
• External Interactions on Hybrid Models of Biological Systems

Cited In (1)

• Persistent stochastic non-interference

Uses Software

• Bio-PEPA

This page was built for publication: Unwinding biological systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348024)