The following pages link to Mirco Tribastone (Q387987):
Displaying 33 items.
- Tackling continuous state-space explosion in a Markovian process algebra (Q387988) (← links)
- Lumpability for uncertain continuous-time Markov chains (Q832091) (← links)
- A computational approach to steady-state convergence of fluid limits for Coxian queuing networks with abandonment (Q2014663) (← links)
- An extension of ERODE to reduce Boolean networks by backward Boolean equivalence (Q2112170) (← links)
- Reducing Boolean networks with backward Boolean equivalence (Q2142096) (← links)
- A large-scale assessment of exact lumping of quantitative models in the biomodels repository (Q2238205) (← links)
- A unified framework for differential aggregations in Markovian process algebra (Q2258842) (← links)
- Efficient syntax-driven lumping of differential equations (Q2272914) (← links)
- A large-scale assessment of exact model reduction in the biomodels repository (Q2326597) (← links)
- Comparing chemical reaction networks: a categorical and algorithmic perspective (Q2422009) (← links)
- Exact fluid lumpability in Markovian process algebra (Q2453115) (← links)
- Quantitative Abstractions for Collective Adaptive Systems (Q2822665) (← links)
- Exact Fluid Lumpability for Markovian Process Algebra (Q2912691) (← links)
- Differential Bisimulation for a Markovian Process Algebra (Q2946344) (← links)
- Approximate Reduction of Heterogenous Nonlinear Models With Differential Hulls (Q2980620) (← links)
- Stochastic Process Algebras (Q3084589) (← links)
- Comparing Chemical Reaction Networks (Q4635906) (← links)
- PID Control of Biochemical Reaction Networks (Q5034100) (← links)
- Differential Equivalence for Linear Differential Algebraic Equations (Q5092262) (← links)
- Syntactic Markovian Bisimulation for Chemical Reaction Networks (Q5217314) (← links)
- Forward and Backward Bisimulations for Chemical Reaction Networks (Q5357706) (← links)
- Symbolic computation of differential equivalences (Q5890964) (← links)
- Symbolic computation of differential equivalences (Q5920213) (← links)
- Bit-precise verification of discontinuity errors under fixed-point arithmetic (Q6045065) (← links)
- Formal lumping of polynomial differential equations through approximate equivalences (Q6113017) (← links)
- From electric circuits to chemical networks (Q6151167) (← links)
- Jump longer to jump less: improving dynamic boundary projection with \(h\)-scaling (Q6160776) (← links)
- An algorithm for the formal reduction of differential equations as over-approximations (Q6160777) (← links)
- Tight Error Analysis in Fixed-point Arithmetic (Q6177466) (← links)
- Algorithmic Minimization of Uncertain Continuous-Time Markov Chains (Q6182729) (← links)
- Certification of the proximal gradient method under fixed-point arithmetic for box-constrained QP problems (Q6431297) (← links)
- Tight Error Analysis in Fixed-Point Arithmetic (Q6487933) (← links)
- Proper lumping for positive bilinear control systems (Q6668060) (← links)
