\textsf{FlyFast}: a scalable approach to probabilistic model-checking based on mean-field approximation

DOI10.1007/978-3-319-68270-9_13MaRDI QIDQ5047045zbMATH OpenOpenAlexWikidataFDO

Authors Michele Loreti, Diego Latella, Mieke Massink

Publication date 9 November 2022

Published in ModelEd, TestEd, TrustEd (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-68270-9_13

zbMATH Keywords

collective adaptive systemsdiscrete-time Markov chainsmean-field approximationprobabilistic on-the-fly model checkingtime-bounded probabilistic computation tree logic

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• On-the-fly fast mean-field model-checking
• Model checking Markov population models by stochastic approximations
• Fluid model checking
• Model checking single agent behaviours by fluid approximation
• Checking individual agent behaviours in Markov population models by fluid approximation

Cited in

(3)

• Model checking Markov population models by stochastic approximations
• Fluid approximation of broadcasting systems
• On-the-fly fast mean-field model-checking

This page was built for publication: \textsf{FlyFast}: a scalable approach to probabilistic model-checking based on mean-field approximation

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