Dense-Timed Pushdown Automata
We propose a model that captures the behavior of real-time recursive systems. To that end, we introduce dense-timed pushdown automata that extend the classical models of pushdown automata and timed automata, in the sense that the automaton operates on a finite set of real-valued clocks, and each sym...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 44 |
|---|---|
| container_issue | |
| container_start_page | 35 |
| container_title | |
| container_volume | |
| creator | Abdulla, Parosh Aziz Atig, Mohamed Faouzi Stenman, Jari |
| description | We propose a model that captures the behavior of real-time recursive systems. To that end, we introduce dense-timed pushdown automata that extend the classical models of pushdown automata and timed automata, in the sense that the automaton operates on a finite set of real-valued clocks, and each symbol in the stack is equipped with a real-valued clock representing its "age". The model induces a transition system that is infinite in two dimensions, namely it gives rise to a stack with an unbounded number of symbols each of which with a real-valued clock. The main contribution of the paper is an EXPTIME-complete algorithm for solving the reachability problem for dense-timed pushdown automata. |
| doi_str_mv | 10.1109/LICS.2012.15 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>swepub_6IE</sourceid><recordid>TN_cdi_ieee_primary_6280422</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6280422</ieee_id><sourcerecordid>oai_DiVA_org_uu_184780</sourcerecordid><originalsourceid>FETCH-LOGICAL-a359t-e882e6d400d074cf2913f64264c136572d973b8444ada92233dbd2ccdd1fc8503</originalsourceid><addsrcrecordid>eNqNkEtLw0AUhccXWGN37kToxpUmzp33LEPro1BQsLodJpmJDpqmZBqK_96Eirh0c8_ifBwuH0JngDMArG8W8-lzRjCQDPgeOsFSaM76o_fRiHDJU86JOvhbHKIRYEZToSQco3GMocCUc46ppCN0MfOr6NNlqL2bPHXx3TXb1STvNk1tN_YUHVX2M_rxTybo5e52OX1IF4_382m-SC3lepN6pYgXjmHssGRlRTTQSjAiWAlUcEmclrRQjDHrrCaEUlc4UpbOQVWq_pMEXe9249avu8Ks21Db9ss0NphZeM1N076ZrjOgmFQDfr7Dg_f-FxZEYdaPJ-hy19qyNkXTfEQD2Az2zGDPDPYM8J67-g9nijb4in4DYMxnLw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Dense-Timed Pushdown Automata</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Abdulla, Parosh Aziz ; Atig, Mohamed Faouzi ; Stenman, Jari</creator><creatorcontrib>Abdulla, Parosh Aziz ; Atig, Mohamed Faouzi ; Stenman, Jari</creatorcontrib><description>We propose a model that captures the behavior of real-time recursive systems. To that end, we introduce dense-timed pushdown automata that extend the classical models of pushdown automata and timed automata, in the sense that the automaton operates on a finite set of real-valued clocks, and each symbol in the stack is equipped with a real-valued clock representing its "age". The model induces a transition system that is infinite in two dimensions, namely it gives rise to a stack with an unbounded number of symbols each of which with a real-valued clock. The main contribution of the paper is an EXPTIME-complete algorithm for solving the reachability problem for dense-timed pushdown automata.</description><identifier>ISSN: 1043-6871</identifier><identifier>ISBN: 0769547699</identifier><identifier>ISBN: 9780769547695</identifier><identifier>ISBN: 1467322636</identifier><identifier>ISBN: 9781467322638</identifier><identifier>EISSN: 2575-5528</identifier><identifier>EISBN: 0769547699</identifier><identifier>EISBN: 9780769547695</identifier><identifier>DOI: 10.1109/LICS.2012.15</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>Washington, DC, USA: IEEE Computer Society</publisher><subject>Analytical models ; Automata ; Clocks ; Computational modeling ; Cost accounting ; Formal verification ; Petri nets ; Theory of computation ; Theory of computation -- Formal languages and automata theory</subject><ispartof>2012 27th Annual IEEE Symposium on Logic in Computer Science, 2012, p.35-44</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-a359t-e882e6d400d074cf2913f64264c136572d973b8444ada92233dbd2ccdd1fc8503</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6280422$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,885,2056,27923,54918</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6280422$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-184780$$DView record from Swedish Publication Index$$Hfree_for_read</backlink></links><search><creatorcontrib>Abdulla, Parosh Aziz</creatorcontrib><creatorcontrib>Atig, Mohamed Faouzi</creatorcontrib><creatorcontrib>Stenman, Jari</creatorcontrib><title>Dense-Timed Pushdown Automata</title><title>2012 27th Annual IEEE Symposium on Logic in Computer Science</title><addtitle>lics</addtitle><description>We propose a model that captures the behavior of real-time recursive systems. To that end, we introduce dense-timed pushdown automata that extend the classical models of pushdown automata and timed automata, in the sense that the automaton operates on a finite set of real-valued clocks, and each symbol in the stack is equipped with a real-valued clock representing its "age". The model induces a transition system that is infinite in two dimensions, namely it gives rise to a stack with an unbounded number of symbols each of which with a real-valued clock. The main contribution of the paper is an EXPTIME-complete algorithm for solving the reachability problem for dense-timed pushdown automata.</description><subject>Analytical models</subject><subject>Automata</subject><subject>Clocks</subject><subject>Computational modeling</subject><subject>Cost accounting</subject><subject>Formal verification</subject><subject>Petri nets</subject><subject>Theory of computation</subject><subject>Theory of computation -- Formal languages and automata theory</subject><issn>1043-6871</issn><issn>2575-5528</issn><isbn>0769547699</isbn><isbn>9780769547695</isbn><isbn>1467322636</isbn><isbn>9781467322638</isbn><isbn>0769547699</isbn><isbn>9780769547695</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNqNkEtLw0AUhccXWGN37kToxpUmzp33LEPro1BQsLodJpmJDpqmZBqK_96Eirh0c8_ifBwuH0JngDMArG8W8-lzRjCQDPgeOsFSaM76o_fRiHDJU86JOvhbHKIRYEZToSQco3GMocCUc46ppCN0MfOr6NNlqL2bPHXx3TXb1STvNk1tN_YUHVX2M_rxTybo5e52OX1IF4_382m-SC3lepN6pYgXjmHssGRlRTTQSjAiWAlUcEmclrRQjDHrrCaEUlc4UpbOQVWq_pMEXe9249avu8Ks21Db9ss0NphZeM1N076ZrjOgmFQDfr7Dg_f-FxZEYdaPJ-hy19qyNkXTfEQD2Az2zGDPDPYM8J67-g9nijb4in4DYMxnLw</recordid><startdate>20120101</startdate><enddate>20120101</enddate><creator>Abdulla, Parosh Aziz</creator><creator>Atig, Mohamed Faouzi</creator><creator>Stenman, Jari</creator><general>IEEE Computer Society</general><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope><scope>ADTPV</scope><scope>BNKNJ</scope><scope>DF2</scope></search><sort><creationdate>20120101</creationdate><title>Dense-Timed Pushdown Automata</title><author>Abdulla, Parosh Aziz ; Atig, Mohamed Faouzi ; Stenman, Jari</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a359t-e882e6d400d074cf2913f64264c136572d973b8444ada92233dbd2ccdd1fc8503</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Analytical models</topic><topic>Automata</topic><topic>Clocks</topic><topic>Computational modeling</topic><topic>Cost accounting</topic><topic>Formal verification</topic><topic>Petri nets</topic><topic>Theory of computation</topic><topic>Theory of computation -- Formal languages and automata theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Abdulla, Parosh Aziz</creatorcontrib><creatorcontrib>Atig, Mohamed Faouzi</creatorcontrib><creatorcontrib>Stenman, Jari</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection><collection>SwePub</collection><collection>SwePub Conference</collection><collection>SWEPUB Uppsala universitet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Abdulla, Parosh Aziz</au><au>Atig, Mohamed Faouzi</au><au>Stenman, Jari</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Dense-Timed Pushdown Automata</atitle><btitle>2012 27th Annual IEEE Symposium on Logic in Computer Science</btitle><stitle>lics</stitle><date>2012-01-01</date><risdate>2012</risdate><spage>35</spage><epage>44</epage><pages>35-44</pages><issn>1043-6871</issn><eissn>2575-5528</eissn><isbn>0769547699</isbn><isbn>9780769547695</isbn><isbn>1467322636</isbn><isbn>9781467322638</isbn><eisbn>0769547699</eisbn><eisbn>9780769547695</eisbn><coden>IEEPAD</coden><abstract>We propose a model that captures the behavior of real-time recursive systems. To that end, we introduce dense-timed pushdown automata that extend the classical models of pushdown automata and timed automata, in the sense that the automaton operates on a finite set of real-valued clocks, and each symbol in the stack is equipped with a real-valued clock representing its "age". The model induces a transition system that is infinite in two dimensions, namely it gives rise to a stack with an unbounded number of symbols each of which with a real-valued clock. The main contribution of the paper is an EXPTIME-complete algorithm for solving the reachability problem for dense-timed pushdown automata.</abstract><cop>Washington, DC, USA</cop><pub>IEEE Computer Society</pub><doi>10.1109/LICS.2012.15</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1043-6871 |
| ispartof | 2012 27th Annual IEEE Symposium on Logic in Computer Science, 2012, p.35-44 |
| issn | 1043-6871 2575-5528 |
| language | eng |
| recordid | cdi_ieee_primary_6280422 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Analytical models Automata Clocks Computational modeling Cost accounting Formal verification Petri nets Theory of computation Theory of computation -- Formal languages and automata theory |
| title | Dense-Timed Pushdown 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-14T05%3A43%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-swepub_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Dense-Timed%20Pushdown%20Automata&rft.btitle=2012%2027th%20Annual%20IEEE%20Symposium%20on%20Logic%20in%20Computer%20Science&rft.au=Abdulla,%20Parosh%20Aziz&rft.date=2012-01-01&rft.spage=35&rft.epage=44&rft.pages=35-44&rft.issn=1043-6871&rft.eissn=2575-5528&rft.isbn=0769547699&rft.isbn_list=9780769547695&rft.isbn_list=1467322636&rft.isbn_list=9781467322638&rft.coden=IEEPAD&rft_id=info:doi/10.1109/LICS.2012.15&rft_dat=%3Cswepub_6IE%3Eoai_DiVA_org_uu_184780%3C/swepub_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=0769547699&rft.eisbn_list=9780769547695&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6280422&rfr_iscdi=true |