Quantitative abstractions for collective adaptive systems
DOI10.1007/978-3-319-34096-8_7zbMATH Open1346.68219OpenAlexW2498481083MaRDI QIDQ2822665FDOQ2822665
Authors: 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
Recommendations
- A logical framework for reasoning about local and global properties of collective systems
- A calculus for collective-adaptive systems and its behavioural theory
- Automatic moment-closure approximation of spatially distributed collective adaptive systems
- On Modeling and Analyzing Sparsely Networked Large-Scale Multi-agent Systems with Cellular and Graph Automata
- Studying complex adaptive systems
Learning and adaptive systems in artificial intelligence (68T05) Agent technology and artificial intelligence (68T42) Large-scale systems (93A15)
Cites Work
- Bio-PEPA: A framework for the modelling and analysis of biological systems
- Simulating the effect of quarantine on the spread of the 1918--19 flu in Central Canada
- Bisimilar linear systems.
- Approximating and computing behavioural distances in probabilistic transition systems
- Title not available (Why is that?)
- The Effect of Lumping and Expanding on Kinetic Differential Equations
- A fluid analysis framework for a Markovian process algebra
- Bisimulation through probabilistic testing
- Three Partition Refinement Algorithms
- Exact and ordinary lumpability in finite Markov chains
- A Compositional Approach to Performance Modelling
- Deciding bisimilarity and similarity for probabilistic processes.
- The interplay of double phosphorylation and scaffolding in MAPK pathways
- Solving non-linear arithmetic
- Optimal state-space lumping in Markov chains
- Simple \(O(m \log n)\) time Markov chain lumping
- Rate-Based Transition Systems for Stochastic Process Calculi
- Exact fluid lumpability for Markovian process algebra
- Lumpability abstractions of rule-based systems
- Equivalence of Dynamical Systems by Bisimulation
- Combining model reductions
- Fragments-based model reduction: some case studies
- Quantitative relations and approximate process equivalences.
- Approximate reasoning for real-time probabilistic processes
- Symbolic optimization with SMT solvers
- Symbolic computation of differential equivalences
- Forward and backward bisimulations for chemical reaction networks
- SMT-based bisimulation minimisation of Markov models
- A unified framework for differential aggregations in Markovian process algebra
- Differential bisimulation for a Markovian process algebra
- Approximate Reduction of Heterogenous Nonlinear Models With Differential Hulls
- Formal reduction for rule-based models
- Computing All Implied Equalities via SMT-Based Partition Refinement
- Automatic moment-closure approximation of spatially distributed collective adaptive systems
Cited In (7)
- Simulation-Based Engineering Of Complex Adaptive Systems
- Design and verification of trusted collective adaptive systems
- A large-scale assessment of exact lumping of quantitative models in the biomodels repository
- A calculus for collective-adaptive systems and its behavioural theory
- Comparing chemical reaction networks: a categorical and algorithmic perspective
- Automatic moment-closure approximation of spatially distributed collective adaptive systems
- A logical framework for reasoning about local and global properties of collective systems
Uses Software
This page was built for publication: Quantitative abstractions for collective adaptive systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822665)
