Sökning: onr:"swepub:oai:DiVA.org:uu-184780" >
Dense-Timed Pushdow...
Dense-Timed Pushdown Automata
-
- Abdulla, Parosh Aziz (författare)
- Uppsala universitet,Datorteknik
-
- Atig, Mohamed Faouzi (författare)
- Uppsala universitet,Datorteknik
-
- Stenman, Jari (författare)
- Uppsala universitet,Datorteknik
-
(creator_code:org_t)
- IEEE Computer Society, 2012
- 2012
- Engelska.
-
Ingår i: Proc. 27th ACM/IEEE Symposium on Logic in Computer Science. - : IEEE Computer Society. - 9780769547695 ; , s. 35-44
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas