Exact fluid lumpability in Markovian process algebra
From MaRDI portal
Publication:2453115
DOI10.1016/j.tcs.2013.07.029zbMath1359.68228OpenAlexW2237280868WikidataQ57790791 ScholiaQ57790791MaRDI QIDQ2453115
Max Tschaikowski, Mirco Tribastone
Publication date: 6 June 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.029
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (5)
Equivalences for fluid stochastic Petri nets ⋮ Comparing chemical reaction networks: a categorical and algorithmic perspective ⋮ Approximate constrained lumping of polynomial differential equations ⋮ A unified framework for differential aggregations in Markovian process algebra ⋮ Logical characterization of fluid equivalences
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Relating continuous and discrete PEPA models of signalling pathways
- A fluid analysis framework for a Markovian process algebra
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- Turning back time in Markovian process algebra.
- Bio-PEPA: A framework for the modelling and analysis of biological systems
- On process rate semantics
- Exact Fluid Lumpability for Markovian Process Algebra
- Dynamical Systems and Stochastic Programming: To Ordinary Differential Equations and Back
- Exact and ordinary lumpability in finite Markov chains
- Fundamental Queries in Aggregation Theory
This page was built for publication: Exact fluid lumpability in Markovian process algebra