Reachability relations of timed pushdown automata
Lorenzo Clemente,Sławomir Lasota +1 more
Reads0
Chats0
TLDR
It is proved that reachability relations of tpda are expressible in linear arithmetic, a rich logic generalising Presburger arithmetic and rational arithmetic.About:
This article is published in Journal of Computer and System Sciences.The article was published on 2021-05-01 and is currently open access. It has received 5 citations till now. The article focuses on the topics: Presburger arithmetic & Quantifier elimination.read more
Citations
More filters
Book ChapterDOI
Fast zone-based algorithms for reachability in pushdown timed automata
TL;DR: Pushdown timed automata (PDTA) as discussed by the authors is an extension of the pushdown model with a stack, and it has been shown that it is possible to reachability in different variants of this model, but most of these results are purely theoretical and do not give rise to efficient implementations.
Journal Article
Binary reachability analysis of discrete pushdown timed automata
TL;DR: The binary reachability of a discrete timed automaton can be accepted by a nondeterministic reversal-bounded multicounter machine and the results can be used to verify a number of properties that can not be expressed by timed temporal logics for discrete timing automata and CTL* for pushdown systems.
Posted Content
Fast zone-based algorithms for reachability in pushdown timed automata
TL;DR: In this paper, the authors show that a naive extension of the zone based reachability algorithm for the control state reachability problem of timed automata is not sound in the presence of a stack.
Book ChapterDOI
General-Nondeterministic Fuzzy Pushdown Automata and Their Languages
Fangping Zhou,Chao Yang +1 more
TL;DR: In this paper , general-nondeterministic fuzzy pushdown automata (GN-FPDAs) are defined and the set of languages accepted by these automata by final states is investigated.
Journal Article
Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata
Xiaojuan Cai,Mizuhito Ogawa +1 more
TL;DR: This paper investigates a general framework of a pushdown system with well-quasi-ordered states and stack alphabet to show decidability of reachability, which is an extension of earlier work (Well-structured Pushdown Systems, CONCUR 2013).
References
More filters
Journal ArticleDOI
A theory of timed automata
Rajeev Alur,David L. Dill +1 more
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
Journal ArticleDOI
On Context-Free Languages
TL;DR: In this report, certain properties of context-free (CF or type 2) Grammars are investigated, like that of Chomsky, and it is shown that this type of grammar is essentially stronger than type 2 grammars and has the advantage over type 1 grammARS that the phrase structure of a grammatical sentence is unique, once the derivation is given.
Journal ArticleDOI
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
TL;DR: The main results of this paper show that the same notions of computability can be realized within the highly restricted monogenic formal systems called by Post the "Tag" systems, and within a peculiarly restricted variant of Turing machine which has two tapes, but can neither write on nor erase these tapes.
Proceedings ArticleDOI
Visibly pushdown languages
Rajeev Alur,P. Madhusudan +1 more
TL;DR: This framework explains, unifies, and generalizes many of the decision procedures in the program analysis literature, and allows algorithmic verification of recursive programs with respect to many context-free properties including access control properties via stack inspection and correctness of procedures withrespect to pre and post conditions.