Robust Model-Checking of Linear-Time Properties in Timed Automata
Formal verification of timed systems is well understood, but their implementation is still challenging. Raskin et al. have recently brought out a model of parameterized timed automata in which the transitions might be slightly delayed or expedited. This model is used to prove that a timed system is...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 249 |
|---|---|
| container_issue | |
| container_start_page | 238 |
| container_title | |
| container_volume | 3887 |
| creator | Bouyer, Patricia Markey, Nicolas Reynier, Pierre-Alain |
| description | Formal verification of timed systems is well understood, but their implementation is still challenging. Raskin et al. have recently brought out a model of parameterized timed automata in which the transitions might be slightly delayed or expedited. This model is used to prove that a timed system is implementable with respect to a safety property, by proving that the parameterized model robustly satisfies the safety property. We extend here the notion of implementability to the broader class of linear-time properties, and provide PSPSACE algorithms for the robust model-checking of Büchi-like and LTL properties. We also show how those algorithms can be adapted in order to verify bounded-response-time properties. |
| doi_str_mv | 10.1007/11682462_25 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>hal_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_19689079</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_01194610v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-c332t-e12e094d77def1072e80fddc9af82b0049b035df926e14d1b36f6e38dfb418003</originalsourceid><addsrcrecordid>eNpVUFtLwzAUjjdwzD35B_rigw_Vc5I0TR7LUCdMFJnPIW2SLa5rR9MJ_ns7Jl6-lwPfjcNHyCXCDQLkt4hCUi6optkRmahcsowDo3km8JiMUCCmjHF18k_L-CkZAQOaqpyzczKJ8R0GMJSCyhEpXttyF_vkqbWuTqcrV61Ds0xan8xD40yXLsLGJS9du3VdH1xMQpPsKZsUu77dmN5ckDNv6ugm33dM3u7vFtNZOn9-eJwW87RijPapQ-pAcZvn1nmEnDoJ3tpKGS9pCcBVCSyzXlHhkFssmfDCMWl9yVEOD4_J9aF3ZWq97cLGdJ-6NUHPirnec4CouED4wMF7dfBuTaxM7TvTVCH-pFAJqSBXv51xkJql63TZtuuoEfR-cv1ncvYFtYtrQg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Robust Model-Checking of Linear-Time Properties in Timed Automata</title><source>Springer Books</source><creator>Bouyer, Patricia ; Markey, Nicolas ; Reynier, Pierre-Alain</creator><contributor>Kiwi, Marcos ; Correa, José R. ; Hevia, Alejandro</contributor><creatorcontrib>Bouyer, Patricia ; Markey, Nicolas ; Reynier, Pierre-Alain ; Kiwi, Marcos ; Correa, José R. ; Hevia, Alejandro</creatorcontrib><description>Formal verification of timed systems is well understood, but their implementation is still challenging. Raskin et al. have recently brought out a model of parameterized timed automata in which the transitions might be slightly delayed or expedited. This model is used to prove that a timed system is implementable with respect to a safety property, by proving that the parameterized model robustly satisfies the safety property. We extend here the notion of implementability to the broader class of linear-time properties, and provide PSPSACE algorithms for the robust model-checking of Büchi-like and LTL properties. We also show how those algorithms can be adapted in order to verify bounded-response-time properties.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540327554</identifier><identifier>ISBN: 354032755X</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540327561</identifier><identifier>EISBN: 3540327568</identifier><identifier>DOI: 10.1007/11682462_25</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer Science ; Computer science; control theory; systems ; Exact sciences and technology ; Implementability ; Logic in Computer Science ; robust verification ; Software ; Software engineering ; Theoretical computing ; timed systems</subject><ispartof>LATIN 2006: Theoretical Informatics, 2006, Vol.3887, p.238-249</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2007 INIST-CNRS</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c332t-e12e094d77def1072e80fddc9af82b0049b035df926e14d1b36f6e38dfb418003</citedby><orcidid>0000-0003-1977-7525 ; 0000-0002-2823-0911</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11682462_25$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11682462_25$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>230,309,310,779,780,784,789,790,793,885,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19689079$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://hal.science/hal-01194610$$DView record in HAL$$Hfree_for_read</backlink></links><search><contributor>Kiwi, Marcos</contributor><contributor>Correa, José R.</contributor><contributor>Hevia, Alejandro</contributor><creatorcontrib>Bouyer, Patricia</creatorcontrib><creatorcontrib>Markey, Nicolas</creatorcontrib><creatorcontrib>Reynier, Pierre-Alain</creatorcontrib><title>Robust Model-Checking of Linear-Time Properties in Timed Automata</title><title>LATIN 2006: Theoretical Informatics</title><description>Formal verification of timed systems is well understood, but their implementation is still challenging. Raskin et al. have recently brought out a model of parameterized timed automata in which the transitions might be slightly delayed or expedited. This model is used to prove that a timed system is implementable with respect to a safety property, by proving that the parameterized model robustly satisfies the safety property. We extend here the notion of implementability to the broader class of linear-time properties, and provide PSPSACE algorithms for the robust model-checking of Büchi-like and LTL properties. We also show how those algorithms can be adapted in order to verify bounded-response-time properties.</description><subject>Applied sciences</subject><subject>Computer Science</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Implementability</subject><subject>Logic in Computer Science</subject><subject>robust verification</subject><subject>Software</subject><subject>Software engineering</subject><subject>Theoretical computing</subject><subject>timed systems</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540327554</isbn><isbn>354032755X</isbn><isbn>9783540327561</isbn><isbn>3540327568</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpVUFtLwzAUjjdwzD35B_rigw_Vc5I0TR7LUCdMFJnPIW2SLa5rR9MJ_ns7Jl6-lwPfjcNHyCXCDQLkt4hCUi6optkRmahcsowDo3km8JiMUCCmjHF18k_L-CkZAQOaqpyzczKJ8R0GMJSCyhEpXttyF_vkqbWuTqcrV61Ds0xan8xD40yXLsLGJS9du3VdH1xMQpPsKZsUu77dmN5ckDNv6ugm33dM3u7vFtNZOn9-eJwW87RijPapQ-pAcZvn1nmEnDoJ3tpKGS9pCcBVCSyzXlHhkFssmfDCMWl9yVEOD4_J9aF3ZWq97cLGdJ-6NUHPirnec4CouED4wMF7dfBuTaxM7TvTVCH-pFAJqSBXv51xkJql63TZtuuoEfR-cv1ncvYFtYtrQg</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Bouyer, Patricia</creator><creator>Markey, Nicolas</creator><creator>Reynier, Pierre-Alain</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0003-1977-7525</orcidid><orcidid>https://orcid.org/0000-0002-2823-0911</orcidid></search><sort><creationdate>2006</creationdate><title>Robust Model-Checking of Linear-Time Properties in Timed Automata</title><author>Bouyer, Patricia ; Markey, Nicolas ; Reynier, Pierre-Alain</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c332t-e12e094d77def1072e80fddc9af82b0049b035df926e14d1b36f6e38dfb418003</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Computer Science</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Implementability</topic><topic>Logic in Computer Science</topic><topic>robust verification</topic><topic>Software</topic><topic>Software engineering</topic><topic>Theoretical computing</topic><topic>timed systems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bouyer, Patricia</creatorcontrib><creatorcontrib>Markey, Nicolas</creatorcontrib><creatorcontrib>Reynier, Pierre-Alain</creatorcontrib><collection>Pascal-Francis</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bouyer, Patricia</au><au>Markey, Nicolas</au><au>Reynier, Pierre-Alain</au><au>Kiwi, Marcos</au><au>Correa, José R.</au><au>Hevia, Alejandro</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Robust Model-Checking of Linear-Time Properties in Timed Automata</atitle><btitle>LATIN 2006: Theoretical Informatics</btitle><date>2006</date><risdate>2006</risdate><volume>3887</volume><spage>238</spage><epage>249</epage><pages>238-249</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540327554</isbn><isbn>354032755X</isbn><eisbn>9783540327561</eisbn><eisbn>3540327568</eisbn><abstract>Formal verification of timed systems is well understood, but their implementation is still challenging. Raskin et al. have recently brought out a model of parameterized timed automata in which the transitions might be slightly delayed or expedited. This model is used to prove that a timed system is implementable with respect to a safety property, by proving that the parameterized model robustly satisfies the safety property. We extend here the notion of implementability to the broader class of linear-time properties, and provide PSPSACE algorithms for the robust model-checking of Büchi-like and LTL properties. We also show how those algorithms can be adapted in order to verify bounded-response-time properties.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11682462_25</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0003-1977-7525</orcidid><orcidid>https://orcid.org/0000-0002-2823-0911</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | LATIN 2006: Theoretical Informatics, 2006, Vol.3887, p.238-249 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19689079 |
| source | Springer Books |
| subjects | Applied sciences Computer Science Computer science control theory systems Exact sciences and technology Implementability Logic in Computer Science robust verification Software Software engineering Theoretical computing timed systems |
| title | Robust Model-Checking of Linear-Time Properties in Timed Automata |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T19%3A25%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Robust%20Model-Checking%20of%20Linear-Time%20Properties%20in%20Timed%20Automata&rft.btitle=LATIN%202006:%20Theoretical%20Informatics&rft.au=Bouyer,%20Patricia&rft.date=2006&rft.volume=3887&rft.spage=238&rft.epage=249&rft.pages=238-249&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540327554&rft.isbn_list=354032755X&rft_id=info:doi/10.1007/11682462_25&rft_dat=%3Chal_pasca%3Eoai_HAL_hal_01194610v1%3C/hal_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540327561&rft.eisbn_list=3540327568&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |