Quantitative Abstractions for Collective Adaptive Systems
From MaRDI portal
Publication:2822665
DOI10.1007/978-3-319-34096-8_7zbMath1346.68219OpenAlexW2498481083MaRDI QIDQ2822665
Andrea Vandin, Mirco Tribastone
Publication date: 4 October 2016
Published in: Formal Methods for the Quantitative Evaluation of Collective Adaptive Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-34096-8_7
Learning and adaptive systems in artificial intelligence (68T05) Large-scale systems (93A15) Agent technology and artificial intelligence (68T42)
Related Items (2)
Comparing chemical reaction networks: a categorical and algorithmic perspective ⋮ A large-scale assessment of exact lumping of quantitative models in the biomodels repository
Uses Software
Cites Work
- Unnamed Item
- Simulating the effect of quarantine on the spread of the 1918--19 flu in Central Canada
- The interplay of double phosphorylation and scaffolding in MAPK pathways
- Lumpability abstractions of rule-based systems
- A fluid analysis framework for a Markovian process algebra
- Optimal state-space lumping in Markov chains
- Bisimulation through probabilistic testing
- Bisimilar linear systems.
- Deciding bisimilarity and similarity for probabilistic processes.
- A unified framework for differential aggregations in Markovian process algebra
- Bio-PEPA: A framework for the modelling and analysis of biological systems
- Approximating and computing behavioural distances in probabilistic transition systems
- Solving Non-linear Arithmetic
- Exact Fluid Lumpability for Markovian Process Algebra
- SMT-Based Bisimulation Minimisation of Markov Models
- Differential Bisimulation for a Markovian Process Algebra
- Approximate Reduction of Heterogenous Nonlinear Models With Differential Hulls
- Combining Model Reductions
- Computing All Implied Equalities via SMT-Based Partition Refinement
- Simple O(m logn) Time Markov Chain Lumping
- Three Partition Refinement Algorithms
- Exact and ordinary lumpability in finite Markov chains
- The Effect of Lumping and Expanding on Kinetic Differential Equations
- Automatic Moment-Closure Approximation of Spatially Distributed Collective Adaptive Systems
- Equivalence of Dynamical Systems by Bisimulation
- Approximate reasoning for real-time probabilistic processes
- Rate-Based Transition Systems for Stochastic Process Calculi
- Forward and Backward Bisimulations for Chemical Reaction Networks
- Fragments-based Model Reduction: Some Case Studies
- Symbolic optimization with SMT solvers
- A Compositional Approach to Performance Modelling
- Formal Reduction for Rule-based Models
- Symbolic computation of differential equivalences
- CONCUR 2003 - Concurrency Theory
This page was built for publication: Quantitative Abstractions for Collective Adaptive Systems
