Timed Pushdown Automata Revisited

This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of dense-timed PDA of Abdulla et al. Collapses: it is expressively equivalent to dense-timed PDA with timeless stack. Motivated by this result, we advocate the framework of fir...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science S. 738 - 749
Hauptverfasser: Clemente, Lorenzo, Lasota, Slawomir
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.07.2015
Schlagworte:
Atomic clocks
Automata
Complexity theory
Handheld computers
orbit-finite
Orbits
pushdown automata
Registers
sets with atoms
timed automata
ISSN:1043-6871
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of dense-timed PDA of Abdulla et al. Collapses: it is expressively equivalent to dense-timed PDA with timeless stack. Motivated by this result, we advocate the framework of first-order definable PDA, a specialization of PDA in sets with atoms, as the right setting to define and investigate timed extensions of PDA. The general model obtained in this way is Turing complete. As our second result we prove NEXPTIME upper complexity bound for the non-emptiness problem for an expressive subclass. As a byproduct, we obtain a tight EXPTIME complexity bound for a more restrictive subclass of PDA with timeless stack, thus subsuming the complexity bound known for dense-timed PDA.
AbstractList This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of dense-timed PDA of Abdulla et al. Collapses: it is expressively equivalent to dense-timed PDA with timeless stack. Motivated by this result, we advocate the framework of first-order definable PDA, a specialization of PDA in sets with atoms, as the right setting to define and investigate timed extensions of PDA. The general model obtained in this way is Turing complete. As our second result we prove NEXPTIME upper complexity bound for the non-emptiness problem for an expressive subclass. As a byproduct, we obtain a tight EXPTIME complexity bound for a more restrictive subclass of PDA with timeless stack, thus subsuming the complexity bound known for dense-timed PDA.
Author Lasota, Slawomir
Clemente, Lorenzo
Author_xml – sequence: 1
  givenname: Lorenzo
  surname: Clemente
  fullname: Clemente, Lorenzo
– sequence: 2
  givenname: Slawomir
  surname: Lasota
  fullname: Lasota, Slawomir
BookMark eNotzE1LwzAYAOAIE9zmbt681B_Q-ubNx5scR5k6KCg6zyNpUozYVpZO8d870NNzexZsNoxDZOyKQ8U52NtmW79UCFxVJM7YypLhkqw1hpScsTkHKUptiF-wRc7vAIBawpzd7FIfQ_F0zG9h_B6K9XEaeze54jl-pZymGC7Zeec-clz9u2Svd5td_VA2j_fbet2UDklOpdO-dRYJvQ3Kd22LnRXRYMCWd4a0BuFJcUDTAWkpdTCRlPekEb2QWizZ9d-bYoz7z0Pq3eFnT5zkaRW_uE8-Vw
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/LICS.2015.73
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781479988754
1479988758
EndPage 749
ExternalDocumentID 7174927
Genre orig-research
GroupedDBID --Z
23M
29P
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-a274t-a6bca9272b9d5bfcc2f93e82d2c1f876603b751028f076446d8e75bb7622b3463
IEDL.DBID RIE
ISICitedReferencesCount 20
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000380427100065&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1043-6871
IngestDate Wed Aug 27 02:33:32 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a274t-a6bca9272b9d5bfcc2f93e82d2c1f876603b751028f076446d8e75bb7622b3463
PageCount 12
ParticipantIDs ieee_primary_7174927
PublicationCentury 2000
PublicationDate 20150701
PublicationDateYYYYMMDD 2015-07-01
PublicationDate_xml – month: 07
  year: 2015
  text: 20150701
  day: 01
PublicationDecade 2010
PublicationTitle 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationTitleAbbrev LICS
PublicationYear 2015
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002640
ssj0002179874
Score 2.1346817
Snippet This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of dense-timed PDA of Abdulla et...
SourceID ieee
SourceType Publisher
StartPage 738
SubjectTerms Atomic clocks
Automata
Complexity theory
Handheld computers
orbit-finite
Orbits
pushdown automata
Registers
sets with atoms
timed automata
Title Timed Pushdown Automata Revisited
URI https://ieeexplore.ieee.org/document/7174927
WOSCitedRecordID wos000380427100065&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED61FQNTgRbxVpAYcZs6sR2PqKICqaoqHlK3yueHYElQm_D7sdMQGFjYLA9---47-747gBsnqUKdacIsNSQ1ihNMlSVMSR4OGEdTh8yfi8UiW63ksgO3LRfGWls7n9lRKNZ_-abQVXgqG3vTI5VUdKErBN9xtdr3FBoibwUo00hhr-ibSAQJ4d4qaJ3e5Xj-OH0OTl1sFLKl_0qqUuuUWf9_ozmA4Q85L1q2aucQOjY_gv53doaouawDuA7sDhMtq-2b8aZ2dFeVhYenKnqqCeUeaQ7hdXb_Mn0gTUIEorzxWBLFUSvfJUVpGDqtqZOJzaiheuK8WONxgoIFyOBi4YEON5kVDNELPIpJypNj6OVFbk8gwixW2lmZKCdSzJgyNtWx48K3pyhOTmEQZrz-2MW8WDeTPfu7-hz2w3ru3FgvoFduKnsJe_qzfN9uruqN-gLvDpFK
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BNNETKhh_OxOPFka3tuvREAnESYhiwo30Z_DCDGz-_bZjTg9evDU7dO26vve99n3vA7izHAupEoWIwRrFWlAkY2EQEZz6H4xKXZbMT9lkksznfNqA-5oLY4wpk89M1zfLu3ydqcIflfVc6BFzzHZg1ytn8S1bqz5Rwb72lgczlR12rr6qRRAh6uKCOu2d99Lx4NWndZGu10v_JatSepVh63_jOYTODz0vmNaO5wgaZnUMrW99hqDarm249fwOHUyLzVK7YDt4KPLMAVQRvJSUcoc1O_A2fJwNRqiSREDChY85ElQq4V6JJddEWqWw5ZFJsMaqb51ho2EkGfGgwYbMQR2qE8OIlM7kYRnFNDqB5ipbmVMIZBIKZQ2PhGWxTIjQJlahpcz1J7Dsn0Hbz3jxsa16sagme_734xvYH82e00U6njxdwIH_ttuk1kto5uvCXMGe-szfN-vrctG-AMJ8lJk
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2015+30th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Timed+Pushdown+Automata+Revisited&rft.au=Clemente%2C+Lorenzo&rft.au=Lasota%2C+Slawomir&rft.date=2015-07-01&rft.pub=IEEE&rft.issn=1043-6871&rft.spage=738&rft.epage=749&rft_id=info:doi/10.1109%2FLICS.2015.73&rft.externalDocID=7174927
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1043-6871&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1043-6871&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1043-6871&client=summon