Adding Time to Pushdown Automata
In this tutorial, we illustrate through examples how we can combine two classical models, namely those of pushdown automata (PDA) and timed automata, in order to obtain timed pushdown automata (TPDA). Furthermore, we describe how the reachability problem for TPDAs can be reduced to the reachability...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2012-12-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1212.3871v1 |
| _version_ | 1818649208047009792 |
|---|---|
| author | Parosh Aziz Abdulla Mohamed Faouzi Atig Jari Stenman |
| author_facet | Parosh Aziz Abdulla Mohamed Faouzi Atig Jari Stenman |
| author_sort | Parosh Aziz Abdulla |
| collection | DOAJ |
| description | In this tutorial, we illustrate through examples how we can combine two classical models, namely those of pushdown automata (PDA) and timed automata, in order to obtain timed pushdown automata (TPDA). Furthermore, we describe how the reachability problem for TPDAs can be reduced to the reachability problem for PDAs. |
| first_indexed | 2024-12-17T01:30:40Z |
| format | Article |
| id | doaj.art-c1e7ba0fcf4344f085e1cbfee2661714 |
| institution | Directory Open Access Journal |
| issn | 2075-2180 |
| language | English |
| last_indexed | 2024-12-17T01:30:40Z |
| publishDate | 2012-12-01 |
| publisher | Open Publishing Association |
| record_format | Article |
| series | Electronic Proceedings in Theoretical Computer Science |
| spelling | doaj.art-c1e7ba0fcf4344f085e1cbfee26617142022-12-21T22:08:34ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802012-12-01103Proc. QFM 201211610.4204/EPTCS.103.1Adding Time to Pushdown AutomataParosh Aziz AbdullaMohamed Faouzi AtigJari StenmanIn this tutorial, we illustrate through examples how we can combine two classical models, namely those of pushdown automata (PDA) and timed automata, in order to obtain timed pushdown automata (TPDA). Furthermore, we describe how the reachability problem for TPDAs can be reduced to the reachability problem for PDAs.http://arxiv.org/pdf/1212.3871v1 |
| spellingShingle | Parosh Aziz Abdulla Mohamed Faouzi Atig Jari Stenman Adding Time to Pushdown Automata Electronic Proceedings in Theoretical Computer Science |
| title | Adding Time to Pushdown Automata |
| title_full | Adding Time to Pushdown Automata |
| title_fullStr | Adding Time to Pushdown Automata |
| title_full_unstemmed | Adding Time to Pushdown Automata |
| title_short | Adding Time to Pushdown Automata |
| title_sort | adding time to pushdown automata |
| url | http://arxiv.org/pdf/1212.3871v1 |
| work_keys_str_mv | AT paroshazizabdulla addingtimetopushdownautomata AT mohamedfaouziatig addingtimetopushdownautomata AT jaristenman addingtimetopushdownautomata |