Possibilistic and probabilistic abstraction-based model checking

DOI10.1007/3-540-45605-8_8MaRDI QIDQ4813201zbMATH OpenFDO

Authors Michael Huth

Publication date 13 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2399/23990115.htm

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On Abstraction of Probabilistic Systems
• Verification and refutation of probabilistic specifications via games
• Model Checking Software
• Validation of Stochastic Systems
• Model checking probabilistic systems

Cited in

(10)

• On finite-state approximants for probabilistic computation tree logic
• Abstraction and probabilities for hybrid logics
• Verification and refutation of probabilistic specifications via games
• Quantitative abstraction refinement
• A unifying framework for model checking labeled Kripke structures, modal transition systems, and interval transition systems
• Probabilistic abstraction for model checking: an approach based on property testing
• Validation of Stochastic Systems
• Model Checking Software
• Constraint-based debugging in probabilistic model checking
• Probabilistic model checking of biological systems with uncertain kinetic rates

This page was built for publication: Possibilistic and probabilistic abstraction-based model checking

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