Automated repair for timed systems

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

KÖLBL, Martin, Stefan LEUE, Thomas WIES, 2022. Automated repair for timed systems. In: Formal Methods in System Design. Springer. 33(4). ISSN 0925-9856. eISSN 1572-8102. Available under: doi: 10.1007/s10703-022-00397-5

@article{Kolbl2022-10Autom-58885, title={Automated repair for timed systems}, year={2022}, doi={10.1007/s10703-022-00397-5}, number={4}, volume={33}, issn={0925-9856}, journal={Formal Methods in System Design}, author={Kölbl, Martin and Leue, Stefan and Wies, Thomas} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:creator>Kölbl, Martin</dc:creator> <dc:contributor>Kölbl, Martin</dc:contributor> <dcterms:rights rdf:resource=""/> <dcterms:isPartOf rdf:resource=""/> <dc:rights>Attribution 4.0 International</dc:rights> <dcterms:title>Automated repair for timed systems</dcterms:title> <dc:date rdf:datatype="">2022-10-24T13:46:10Z</dc:date> <dc:creator>Wies, Thomas</dc:creator> <dcterms:abstract xml:lang="eng">We present algorithms and techniques for the repair of timed system models, given as networks of timed automata (NTA). The repair is based on an analysis of timed diagnostic traces (TDTs) that are computed by real-time model checking tools, such as UPPAAL, when they detect the violation of a timed safety property. We present an encoding of TDTs in linear real arithmetic and use the MaxSMT capabilities of the SMT solver Z3 to suggest a minimal number of possible syntactic repairs of the analyzed model. The suggested repairs include modified values for clock bounds in location invariants and transition guards, adding or removing clock resets, etc. We then present an admissibility criterion, called functional equivalence, which ensures that the proposed repair preserves the functional behavior of the considered NTA. We discuss a proof-of-concept tool called TarTar that we have developed, implementing the repair and admissibility analysis, and give insights into its design and architecture. We evaluate the proposed repair technique on faulty mutations generated from a diverse suite of case studies taken from the literature. We show that TarTar can admissibly repair for 69–88% of the seeded errors in the considered system models.</dcterms:abstract> <dcterms:available rdf:datatype="">2022-10-24T13:46:10Z</dcterms:available> <dcterms:issued>2022-10</dcterms:issued> <dc:contributor>Leue, Stefan</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Wies, Thomas</dc:contributor> <dc:language>eng</dc:language> <bibo:uri rdf:resource=""/> <dc:creator>Leue, Stefan</dc:creator> <dspace:isPartOfCollection rdf:resource=""/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Attribution 4.0 International Except where otherwise noted, this item's license is described as Attribution 4.0 International

Search KOPS


My Account