KŘETÍNSKÝ, Jan. Survey of Statistical Verification of Linear Unbounded Properties: Model Checking and Distances. In Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques - 7th International Symposium, ISoLA 2016. Switzerland: Springer. p. 27-45. ISBN 978-3-319-47165-5. doi:10.1007/978-3-319-47166-2_3. 2016.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Survey of Statistical Verification of Linear Unbounded Properties: Model Checking and Distances
Authors KŘETÍNSKÝ, Jan (203 Czech Republic, guarantor, belonging to the institution).
Edition Switzerland, Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques - 7th International Symposium, ISoLA 2016, p. 27-45, 19 pp. 2016.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Switzerland
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/16:00088474
Organization unit Faculty of Informatics
ISBN 978-3-319-47165-5
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-319-47166-2_3
Keywords in English verification; statistical model checking; probabilistic systems
Tags formela-conference
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 27/4/2017 07:03.
Abstract
We survey statistical verification techniques aiming at linear properties with unbounded or infinite horizon, as opposed to properties of runs of fixed length. We discuss statistical model checking of Markov chains and Markov decision processes against reachability, unbounded-until, LTL and mean-payoff properties. Moreover, the respective strategies can be represented efficiently using statistical techniques. Further, we also discuss when it is possible to statistically estimate linear distances between Markov chains.
Links
GBP202/12/G061, research and development projectName: Centrum excelence - Institut teoretické informatiky (CE-ITI) (Acronym: CE-ITI)
Investor: Czech Science Foundation
PrintDisplayed: 20/4/2024 02:20