Branching data structures for real-time model checking not as good as thought

Autores
Pérez, Gervasio; Pavese, Esteban; Schapachnik, Fernando
Año de publicación
2012
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Clock Difference Diagrams (CDDs), BDD-like data structures for model checking of timed automata, were presented as alternatives for classic DBM representation. However, work on them seems to have stopped, although there are still important open questions. CDD definition required that repeated subtrees were aliased, but no clear algorithm was presented for producing such compact representation, which seems costly to achieve. In this article we describe our implementation of such aliased subtrees and revisit CDDs by comparing their performance against DBMs on current case studies, with and without repeated subtrees. Our experiments show that CDDs still require more time and memory than DBMs, suggesting that eliminating repetitions is still not enough. Thus, this article re-opens issues that previous work on the topic considered closed.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
Model Checking
Real-Time
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/123894
Acceder
id SEDICI_30b8c445ab0d867fc366e826c16f531c
oai_identifier_str oai:sedici.unlp.edu.ar:10915/123894
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Branching data structures for real-time model checking not as good as thoughtPérez, GervasioPavese, EstebanSchapachnik, FernandoCiencias InformáticasModel CheckingReal-TimeClock Difference Diagrams (CDDs), BDD-like data structures for model checking of timed automata, were presented as alternatives for classic DBM representation. However, work on them seems to have stopped, although there are still important open questions. CDD definition required that repeated subtrees were aliased, but no clear algorithm was presented for producing such compact representation, which seems costly to achieve. In this article we describe our implementation of such aliased subtrees and revisit CDDs by comparing their performance against DBMs on current case studies, with and without repeated subtrees. Our experiments show that CDDs still require more time and memory than DBMs, suggesting that eliminating repetitions is still not enough. Thus, this article re-opens issues that previous work on the topic considered closed.Sociedad Argentina de Informática e Investigación Operativa2012-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf60-74http://sedici.unlp.edu.ar/handle/10915/123894enginfo:eu-repo/semantics/altIdentifier/issn/1850-2792info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T11:01:44Zoai:sedici.unlp.edu.ar:10915/123894Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 11:01:45.03SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Branching data structures for real-time model checking not as good as thought
title Branching data structures for real-time model checking not as good as thought
spellingShingle Branching data structures for real-time model checking not as good as thought
Pérez, Gervasio
Ciencias Informáticas
Model Checking
Real-Time
title_short Branching data structures for real-time model checking not as good as thought
title_full Branching data structures for real-time model checking not as good as thought
title_fullStr Branching data structures for real-time model checking not as good as thought
title_full_unstemmed Branching data structures for real-time model checking not as good as thought
title_sort Branching data structures for real-time model checking not as good as thought
dc.creator.none.fl_str_mv Pérez, Gervasio
Pavese, Esteban
Schapachnik, Fernando
author Pérez, Gervasio
author_facet Pérez, Gervasio
Pavese, Esteban
Schapachnik, Fernando
author_role author
author2 Pavese, Esteban
Schapachnik, Fernando
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Model Checking
Real-Time
topic Ciencias Informáticas
Model Checking
Real-Time
dc.description.none.fl_txt_mv Clock Difference Diagrams (CDDs), BDD-like data structures for model checking of timed automata, were presented as alternatives for classic DBM representation. However, work on them seems to have stopped, although there are still important open questions. CDD definition required that repeated subtrees were aliased, but no clear algorithm was presented for producing such compact representation, which seems costly to achieve. In this article we describe our implementation of such aliased subtrees and revisit CDDs by comparing their performance against DBMs on current case studies, with and without repeated subtrees. Our experiments show that CDDs still require more time and memory than DBMs, suggesting that eliminating repetitions is still not enough. Thus, this article re-opens issues that previous work on the topic considered closed.
Sociedad Argentina de Informática e Investigación Operativa
description Clock Difference Diagrams (CDDs), BDD-like data structures for model checking of timed automata, were presented as alternatives for classic DBM representation. However, work on them seems to have stopped, although there are still important open questions. CDD definition required that repeated subtrees were aliased, but no clear algorithm was presented for producing such compact representation, which seems costly to achieve. In this article we describe our implementation of such aliased subtrees and revisit CDDs by comparing their performance against DBMs on current case studies, with and without repeated subtrees. Our experiments show that CDDs still require more time and memory than DBMs, suggesting that eliminating repetitions is still not enough. Thus, this article re-opens issues that previous work on the topic considered closed.
publishDate 2012
dc.date.none.fl_str_mv 2012-08
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
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://sedici.unlp.edu.ar/handle/10915/123894
url http://sedici.unlp.edu.ar/handle/10915/123894
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/1850-2792
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
60-74
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260515297951744
score 13.13397

Publicaciones similares