Unwinding biological systems

DOI10.1016/J.TCS.2015.02.045MaRDI QIDQ2348024zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(1)

• Persistent stochastic non-interference

Describes a project that uses

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)