Topic
Pushdown automaton
About: Pushdown automaton is a research topic. Over the lifetime, 1868 publications have been published within this topic receiving 35399 citations.
Papers published on a yearly basis
Papers
More filters
Proceedings Article•
25 Jul 2015TL;DR: This paper introduces pushdown game structures over which ATL?
Abstract: In this paper we investigate the model-checking problem of pushdown multi-agent systems for ATL? specifications. To this aim, we introduce pushdown game structures over which ATL? formulas are interpreted. We show an algorithm that solves the addressed model-checking problem in 3EXPTIME. We also provide a 2EXPSPACE lower bound by showing a reduction from the word acceptance problem for deterministic Turing machines with doubly exponential space.
15 citations
25 Mar 2002
TL;DR: Enough conditions are studied to ensure that an automaton operating in discrete-time refines a hybrid automaton with its underlying continuous time model, which provides the notion of refinement.
Abstract: Notations like hybrid automata are highly useful in the development process of hybrid systems to document requirements in early design steps. When it comes to implementation a part of the requirements will be realized in software in a discrete-time manner. We therefore study sufficient conditions which ensure that an automaton operating in discrete-time refines a hybrid automaton with its underlying continuous time model. Our notion of refinement provides that vital properties which have been established for the hybrid automaton also hold for its refinement. Furthermore, we outline a method how to derive a discrete-time refinement from a hybrid automaton.
15 citations
TL;DR: It is shown that for every finite-state automaton there exists an equivalent nondeterministic automaton with a planar state graph, but there are no equivalent deterministic automata with no equivalent planar graph.
Abstract: It is shown that for every finite-state automaton there exists an equivalent nondeterministic automaton with a planar state graph. However there exist finite-state automata with no equivalent deterministic automaton with a planar state graph.
15 citations
Patent•
19 Jul 2006
TL;DR: In this article, a PushDown Automaton (PDA) and a Context Free Grammar (CFG) are used to process data in a computer architecture using a PDA engine that maintains semantic states that correspond to semantic elements in an input data set.
Abstract: A computer architecture uses a PushDown Automaton (PDA) and a Context Free Grammar (CFG) to process data. A PDA engine maintains semantic states that correspond to semantic elements in an input data set. The PDA engine does not have to maintain a new state for each new character in a target search string and typically only transitions to a new state when the entire semantic element is detected. The PDA engine can therefore use a smaller and more predictable state table than DFA algorithms. Transitions between the semantic states are managed using a stack that allows multiple semantic states to be represented by a single nested non-terminal symbol.
15 citations
TL;DR: It is shown that model-checking pPDA against general PCTL formulae is undecidable, but it is yielded positive decidability results for the qualitative fragments of P CTL and PCTl^@?
15 citations