Sökning: onr:"swepub:oai:DiVA.org:uu-238136" >
Zenoness for Timed ...
Zenoness for 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)
- 2014
- 2014
- Engelska.
-
Ingår i: Proceedings 15th International Workshop on Verification of Infinite-State Systems, {INFINITY} 2013, Hanoi, Vietnam, 14th October 2013.. ; , s. -47
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.4...
-
visa färre...
Abstract
Ämnesord
Stäng
- Timed pushdown automata are pushdown automata extended with a finite set of real-valued clocks. Additionaly, each symbol in the stack is equipped with a value representing its age. The enabledness of a transition may depend on the values of the clocks and the age of the topmost symbol. Therefore, dense-timed pushdown automata subsume both pushdown automata and timed automata. We have previously shown that the reachability problem for this model is decidable. In this paper, we study the zenoness problem and show that it is EXPTIME-complete.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Datorsystem (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Computer Systems (hsv//eng)
Nyckelord
- Timed Systems
- Pushdown automata
- Datavetenskap
- Computer Science
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)