Robustness and Implementability of Timed Automata

Robustness and Implementability of Timed Automata

In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by Δ to cope with the reaction delay of the controller. We showed that this semantics is implementable provided there exists a strictly positive value for the parameter Δ for which the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: De Wulf, Martin, Doyen, Laurent, Markey, Nicolas, Raskin, Jean-François
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Automata. Abstract machines. Turing machines
Computer science
control theory
systems
Exact sciences and technology
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 133
container_issue
container_start_page 118
container_title
container_volume
creator De Wulf, Martin
Doyen, Laurent
Markey, Nicolas
Raskin, Jean-François
description In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by Δ to cope with the reaction delay of the controller. We showed that this semantics is implementable provided there exists a strictly positive value for the parameter Δ for which the strategy is correct. In this paper, we define the implementability problem to be the question of existence of such a Δ. We show that this question is closely related to a notion of robustness for timed automata defined in [Pur98] and prove that the implementability problem is decidable.
doi_str_mv 10.1007/978-3-540-30206-3_10
format Book Chapter
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16335695</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16335695</sourcerecordid><originalsourceid>FETCH-LOGICAL-p274t-b6b33cb04b0e1f3f0962f0081ee2f795f39d102b0a0f04a35a3c428b406a0b283</originalsourceid><addsrcrecordid>eNo9kMtqwzAQRdUXNKT-gy686VLtSCNL1jKEPgKBQknXQnKk4tYvLGeRv6-clM7mwr2HWRxC7hk8MgD1pFVJkRYCKAIHSdEwuCBZqjGVpw4vyYJJxiii0Ff_G0cmlbomi5miWgm8JVmM35COFYoLvSDso3eHOHU-xtx2-3zTDo1vfTdZVzf1dMz7kO_q1u_z1WHqWzvZO3ITbBN99pdL8vnyvFu_0e3762a92tKBKzFRJx1i5UA48CxgAC15ACiZ9zwoXQTUewbcgYUAwmJhsRK8dAKkBcdLXJKH89_Bxso2YbRdVUczjHVrx6NhErGQukgcP3MxTd2XH43r-5-YLJnZn0kyDJqkw5xcmdkf_gKJP1w_</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Robustness and Implementability of Timed Automata</title><source>Springer Books</source><creator>De Wulf, Martin ; Doyen, Laurent ; Markey, Nicolas ; Raskin, Jean-François</creator><contributor>Yovine, Sergio ; Lakhnech, Yassine</contributor><creatorcontrib>De Wulf, Martin ; Doyen, Laurent ; Markey, Nicolas ; Raskin, Jean-François ; Yovine, Sergio ; Lakhnech, Yassine</creatorcontrib><description>In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by Δ to cope with the reaction delay of the controller. We showed that this semantics is implementable provided there exists a strictly positive value for the parameter Δ for which the strategy is correct. In this paper, we define the implementability problem to be the question of existence of such a Δ. We show that this question is closely related to a notion of robustness for timed automata defined in [Pur98] and prove that the implementability problem is decidable.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540231677</identifier><identifier>ISBN: 3540231676</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540302063</identifier><identifier>EISBN: 3540302069</identifier><identifier>DOI: 10.1007/978-3-540-30206-3_10</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Automata. Abstract machines. Turing machines ; Computer science; control theory; systems ; Exact sciences and technology ; Theoretical computing</subject><ispartof>Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, 2004, p.118-133</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-30206-3_10$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-30206-3_10$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,777,778,782,787,788,791,4038,4039,27908,38238,41425,42494</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=16335695$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Yovine, Sergio</contributor><contributor>Lakhnech, Yassine</contributor><creatorcontrib>De Wulf, Martin</creatorcontrib><creatorcontrib>Doyen, Laurent</creatorcontrib><creatorcontrib>Markey, Nicolas</creatorcontrib><creatorcontrib>Raskin, Jean-François</creatorcontrib><title>Robustness and Implementability of Timed Automata</title><title>Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems</title><description>In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by Δ to cope with the reaction delay of the controller. We showed that this semantics is implementable provided there exists a strictly positive value for the parameter Δ for which the strategy is correct. In this paper, we define the implementability problem to be the question of existence of such a Δ. We show that this question is closely related to a notion of robustness for timed automata defined in [Pur98] and prove that the implementability problem is decidable.</description><subject>Applied sciences</subject><subject>Automata. Abstract machines. Turing machines</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540231677</isbn><isbn>3540231676</isbn><isbn>9783540302063</isbn><isbn>3540302069</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2004</creationdate><recordtype>book_chapter</recordtype><recordid>eNo9kMtqwzAQRdUXNKT-gy686VLtSCNL1jKEPgKBQknXQnKk4tYvLGeRv6-clM7mwr2HWRxC7hk8MgD1pFVJkRYCKAIHSdEwuCBZqjGVpw4vyYJJxiii0Ff_G0cmlbomi5miWgm8JVmM35COFYoLvSDso3eHOHU-xtx2-3zTDo1vfTdZVzf1dMz7kO_q1u_z1WHqWzvZO3ITbBN99pdL8vnyvFu_0e3762a92tKBKzFRJx1i5UA48CxgAC15ACiZ9zwoXQTUewbcgYUAwmJhsRK8dAKkBcdLXJKH89_Bxso2YbRdVUczjHVrx6NhErGQukgcP3MxTd2XH43r-5-YLJnZn0kyDJqkw5xcmdkf_gKJP1w_</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>De Wulf, Martin</creator><creator>Doyen, Laurent</creator><creator>Markey, Nicolas</creator><creator>Raskin, Jean-François</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>Robustness and Implementability of Timed Automata</title><author>De Wulf, Martin ; Doyen, Laurent ; Markey, Nicolas ; Raskin, Jean-François</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p274t-b6b33cb04b0e1f3f0962f0081ee2f795f39d102b0a0f04a35a3c428b406a0b283</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Automata. Abstract machines. Turing machines</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>De Wulf, Martin</creatorcontrib><creatorcontrib>Doyen, Laurent</creatorcontrib><creatorcontrib>Markey, Nicolas</creatorcontrib><creatorcontrib>Raskin, Jean-François</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>De Wulf, Martin</au><au>Doyen, Laurent</au><au>Markey, Nicolas</au><au>Raskin, Jean-François</au><au>Yovine, Sergio</au><au>Lakhnech, Yassine</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Robustness and Implementability of Timed Automata</atitle><btitle>Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2004</date><risdate>2004</risdate><spage>118</spage><epage>133</epage><pages>118-133</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540231677</isbn><isbn>3540231676</isbn><eisbn>9783540302063</eisbn><eisbn>3540302069</eisbn><abstract>In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by Δ to cope with the reaction delay of the controller. We showed that this semantics is implementable provided there exists a strictly positive value for the parameter Δ for which the strategy is correct. In this paper, we define the implementability problem to be the question of existence of such a Δ. We show that this question is closely related to a notion of robustness for timed automata defined in [Pur98] and prove that the implementability problem is decidable.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-30206-3_10</doi><tpages>16</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, 2004, p.118-133
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_16335695
source Springer Books
subjects Applied sciences
Automata. Abstract machines. Turing machines
Computer science
control theory
systems
Exact sciences and technology
Theoretical computing
title Robustness and Implementability of Timed Automata
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T20%3A21%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Robustness%20and%20Implementability%20of%20Timed%20Automata&rft.btitle=Formal%20Techniques,%20Modelling%20and%20Analysis%20of%20Timed%20and%20Fault-Tolerant%20Systems&rft.au=De%20Wulf,%20Martin&rft.date=2004&rft.spage=118&rft.epage=133&rft.pages=118-133&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540231677&rft.isbn_list=3540231676&rft_id=info:doi/10.1007/978-3-540-30206-3_10&rft_dat=%3Cpascalfrancis_sprin%3E16335695%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540302063&rft.eisbn_list=3540302069&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true