Language-based abstractions for dynamical systems

DOI10.4204/EPTCS.250.2MaRDI QIDQ7021649zbMATH OpenFDO

Authors Andrea Vandin

Publication date 26 February 2025

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4204/EPTCS.250.2

Mathematics Subject Classification ID

Equivalence and asymptotic equivalence of ordinary differential equations (34C41) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A fluid analysis framework for a Markovian process algebra
• A language for biochemical systems: design and formal specification
• Analysis of Kinetic Reaction Mechanisms
• Approximate reasoning for real-time probabilistic processes
• Approximate Reduction of Heterogenous Nonlinear Models With Differential Hulls
• Approximating and computing behavioural distances in probabilistic transition systems
• Bio-PEPA: A framework for the modelling and analysis of biological systems
• Bisimilar linear systems.
• Bisimulation through probabilistic testing
• Comparing Chemical Reaction Networks
• Deciding bisimilarity and similarity for probabilistic processes.
• Differential bisimulation for a Markovian process algebra
• Efficient syntax-driven lumping of differential equations
• Exact fluid lumpability for Markovian process algebra
• Exact fluid lumpability in Markovian process algebra
• Formal molecular biology
• Forward and backward bisimulations for chemical reaction networks
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• Lumpability abstractions of rule-based systems
• Mathematical biology. Vol. 1: An introduction.
• Metrics for labelled Markov processes
• On process rate semantics
• Optimal state-space lumping in Markov chains
• Quantitative abstractions for collective adaptive systems
• Simple O(m n) time Markov chain lumping
• SMT-based bisimulation minimisation of Markov models
• Specification, algebra, and software. Essays dedicated to Kokichi Futatsugi
• Symbolic computation of differential equivalences
• Taking it to the limit: approximate reasoning for Markov processes
• The Effect of Lumping and Expanding on Kinetic Differential Equations
• Three Partition Refinement Algorithms

Cited in

(1)

• Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond

This page was built for publication: Language-based abstractions for dynamical systems

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