Efficient simulation-based verification of probabilistic timed automata

Autores
Hartmanns, Arnd; Sedwards, Sean; D'Argenio, Pedro Ruben
Año de publicación
2017
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Ponencia presentada en la 2017 Winter Simulation Conference ed (WSC), 03-06 December, 2017. Las Vegas, NV, USA.
Fil: D'Argenio, Pedro Ruben. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación; Argentina.
Fil: Hartmanns, Arnd. University of Twente; Netherlands.
Fil: Sedwards, Sean. National Institute of Informatics; Japan.
Probabilistic timed automata are a formal model for real-time systems with discrete probabilistic and nondeterministic choices. To overcome the state space explosion problem of exhaustive verification, a symbolic simulation-based approach that soundly treats nondeterminism to approximate maximum and minimum reachability probabilities has recently become available. Its use of difference-bound matrices to handle continuous real time however leads to poor performance: most operations are cubic or even exponential in the number of clock variables. In this paper, we propose a novel region-based approach and data structure that reduce the complexity of all operations to being linear. It relies on a particular mapping between symbolic regions and concrete representative valuations. Using an implementation within the MODEST TOOLSET, we show that the new approach is not only easier to implement, but indeed significantly outperforms all current alternatives on standard benchmark models.
http://dx.doi.org/10.1109/WSC.2017.8247885
Fil: D'Argenio, Pedro Ruben. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación; Argentina.
Fil: Hartmanns, Arnd. University of Twente; Netherlands.
Fil: Sedwards, Sean. National Institute of Informatics; Japan.
Ciencias de la Computación
Materia
Statistical model checking
Non determinism
Probabilistic timed automata
Nivel de accesibilidad
acceso abierto
Condiciones de uso
Repositorio
Repositorio Digital Universitario (UNC)
Institución
Universidad Nacional de Córdoba
OAI Identificador
oai:rdu.unc.edu.ar:11086/562330
Acceder
id RDUUNC_732aaabd11dc1e93d52a2d537a3bf20f
oai_identifier_str oai:rdu.unc.edu.ar:11086/562330
network_acronym_str RDUUNC
repository_id_str 2572
network_name_str Repositorio Digital Universitario (UNC)
spelling Efficient simulation-based verification of probabilistic timed automataHartmanns, ArndSedwards, SeanD'Argenio, Pedro RubenStatistical model checkingNon determinismProbabilistic timed automataPonencia presentada en la 2017 Winter Simulation Conference ed (WSC), 03-06 December, 2017. Las Vegas, NV, USA.Fil: D'Argenio, Pedro Ruben. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación; Argentina.Fil: Hartmanns, Arnd. University of Twente; Netherlands.Fil: Sedwards, Sean. National Institute of Informatics; Japan.Probabilistic timed automata are a formal model for real-time systems with discrete probabilistic and nondeterministic choices. To overcome the state space explosion problem of exhaustive verification, a symbolic simulation-based approach that soundly treats nondeterminism to approximate maximum and minimum reachability probabilities has recently become available. Its use of difference-bound matrices to handle continuous real time however leads to poor performance: most operations are cubic or even exponential in the number of clock variables. In this paper, we propose a novel region-based approach and data structure that reduce the complexity of all operations to being linear. It relies on a particular mapping between symbolic regions and concrete representative valuations. Using an implementation within the MODEST TOOLSET, we show that the new approach is not only easier to implement, but indeed significantly outperforms all current alternatives on standard benchmark models.http://dx.doi.org/10.1109/WSC.2017.8247885Fil: D'Argenio, Pedro Ruben. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación; Argentina.Fil: Hartmanns, Arnd. University of Twente; Netherlands.Fil: Sedwards, Sean. National Institute of Informatics; Japan.Ciencias de la Computación2017info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://hdl.handle.net/11086/562330https://dl.acm.org/doi/abs/10.5555/3242181.3242296https://doi.org/10.1109/WSC.2017.8247885enginfo:eu-repo/semantics/openAccessreponame:Repositorio Digital Universitario (UNC)instname:Universidad Nacional de Córdobainstacron:UNC2026-10-01T10:21:01Zoai:rdu.unc.edu.ar:11086/562330Institucionalhttps://rdu.unc.edu.ar/Universidad públicaNo correspondehttp://rdu.unc.edu.ar/oai/snrdoca.unc@gmail.comArgentinaNo correspondeNo correspondeNo correspondeopendoar:25722026-10-01 10:21:01.656Repositorio Digital Universitario (UNC) - Universidad Nacional de Córdobafalse
dc.title.none.fl_str_mv Efficient simulation-based verification of probabilistic timed automata
title Efficient simulation-based verification of probabilistic timed automata
spellingShingle Efficient simulation-based verification of probabilistic timed automata
Hartmanns, Arnd
Statistical model checking
Non determinism
Probabilistic timed automata
title_short Efficient simulation-based verification of probabilistic timed automata
title_full Efficient simulation-based verification of probabilistic timed automata
title_fullStr Efficient simulation-based verification of probabilistic timed automata
title_full_unstemmed Efficient simulation-based verification of probabilistic timed automata
title_sort Efficient simulation-based verification of probabilistic timed automata
dc.creator.none.fl_str_mv Hartmanns, Arnd
Sedwards, Sean
D'Argenio, Pedro Ruben
author Hartmanns, Arnd
author_facet Hartmanns, Arnd
Sedwards, Sean
D'Argenio, Pedro Ruben
author_role author
author2 Sedwards, Sean
D'Argenio, Pedro Ruben
author2_role author
author
dc.subject.none.fl_str_mv Statistical model checking
Non determinism
Probabilistic timed automata
topic Statistical model checking
Non determinism
Probabilistic timed automata
dc.description.none.fl_txt_mv Ponencia presentada en la 2017 Winter Simulation Conference ed (WSC), 03-06 December, 2017. Las Vegas, NV, USA.
Fil: D'Argenio, Pedro Ruben. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación; Argentina.
Fil: Hartmanns, Arnd. University of Twente; Netherlands.
Fil: Sedwards, Sean. National Institute of Informatics; Japan.
Probabilistic timed automata are a formal model for real-time systems with discrete probabilistic and nondeterministic choices. To overcome the state space explosion problem of exhaustive verification, a symbolic simulation-based approach that soundly treats nondeterminism to approximate maximum and minimum reachability probabilities has recently become available. Its use of difference-bound matrices to handle continuous real time however leads to poor performance: most operations are cubic or even exponential in the number of clock variables. In this paper, we propose a novel region-based approach and data structure that reduce the complexity of all operations to being linear. It relies on a particular mapping between symbolic regions and concrete representative valuations. Using an implementation within the MODEST TOOLSET, we show that the new approach is not only easier to implement, but indeed significantly outperforms all current alternatives on standard benchmark models.
http://dx.doi.org/10.1109/WSC.2017.8247885
Fil: D'Argenio, Pedro Ruben. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación; Argentina.
Fil: Hartmanns, Arnd. University of Twente; Netherlands.
Fil: Sedwards, Sean. National Institute of Informatics; Japan.
Ciencias de la Computación
description Ponencia presentada en la 2017 Winter Simulation Conference ed (WSC), 03-06 December, 2017. Las Vegas, NV, USA.
publishDate 2017
dc.date.none.fl_str_mv 2017
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11086/562330
https://dl.acm.org/doi/abs/10.5555/3242181.3242296
https://doi.org/10.1109/WSC.2017.8247885
url http://hdl.handle.net/11086/562330
https://dl.acm.org/doi/abs/10.5555/3242181.3242296
https://doi.org/10.1109/WSC.2017.8247885
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositorio Digital Universitario (UNC)
instname:Universidad Nacional de Córdoba
instacron:UNC
reponame_str Repositorio Digital Universitario (UNC)
collection Repositorio Digital Universitario (UNC)
instname_str Universidad Nacional de Córdoba
instacron_str UNC
institution UNC
repository.name.fl_str_mv Repositorio Digital Universitario (UNC) - Universidad Nacional de Córdoba
repository.mail.fl_str_mv oca.unc@gmail.com
_version_ 1877859082366353408
score 12.853507

Publicaciones similares