\(\epsilon\)-semantics computations on biological systems

DOI10.1016/j.ic.2014.01.011zbMath1312.68127OpenAlexW2092412604MaRDI QIDQ2453211

Carla Piazza, J. Fabriková, Tommaso Dreossi, Alberto Casagrande

Publication date: 6 June 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2014.01.011

zbMATH Keywords

hybrid systemsreachability problem\(\epsilon\)-semantics

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Systems biology, networks (92C42)

Related Items

Reachability computation for polynomial dynamical systems ⋮ Parameter synthesis of polynomial dynamical systems

Uses Software

• REDLOG
• SpaceEx
• pyHybrid Analysis
• Pyhybridanalysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology
• Inclusion dynamics hybrid automata
• O-minimal hybrid systems.
• Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable
• Logical Analysis of Hybrid Systems
• Approximation Metrics for Discrete and Continuous Systems
• Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
• Symbolic reachability computation for families of linear vector fields