Results 1  10
of
39,670
Pushdown automata
"... This chapter introduces Pushdown Automata, and presents their basic theory. The two language families defined by pda (acceptance by final state, resp. by empty stack) are shown to be equal. The pushdown languages are shown to be equal to the contextfree languages. Closure properties of the context ..."
Abstract
 Add to MetaCart
This chapter introduces Pushdown Automata, and presents their basic theory. The two language families defined by pda (acceptance by final state, resp. by empty stack) are shown to be equal. The pushdown languages are shown to be equal to the contextfree languages. Closure properties of the context
Reachability Analysis of Pushdown Automata: Application to ModelChecking
, 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract

Cited by 385 (39 self)
 Add to MetaCart
We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like
Analyzing Probabilistic Pushdown Automata
 FORMAL METHODS IN SYSTEM DESIGN
, 2012
"... The paper gives a summary of the existing results about algorithmic analysis of probabilistic pushdown automata and their subclasses. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The paper gives a summary of the existing results about algorithmic analysis of probabilistic pushdown automata and their subclasses.
Bisimilarity of Pushdown Automata is nonelementary
"... Given two pushdown automata, the bisimilarity problem asks whether the infinite transition systems they induce are bisimilar. While this problem is known to be decidable our main result states that it is nonelementary, improving EXPTIMEhardness, which was the best previously known lower bound for t ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Given two pushdown automata, the bisimilarity problem asks whether the infinite transition systems they induce are bisimilar. While this problem is known to be decidable our main result states that it is nonelementary, improving EXPTIMEhardness, which was the best previously known lower bound
2Visibly Pushdown Automata
"... Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations are driven by the input. In this paper, we consider VPA with two stacks, namely 2VPA. These automata introduce a useful model to effectively describe concurrent pushdown systems using a simple communi ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Visibly Pushdown Automata (VPA) are a special case of pushdown machines where the stack operations are driven by the input. In this paper, we consider VPA with two stacks, namely 2VPA. These automata introduce a useful model to effectively describe concurrent pushdown systems using a simple
Pushdown dimension
 Theoretical Computer Science
, 2007
"... Abstract Resourcebounded dimension is a notion of computational information density of infinite sequences based on computationally bounded gamblers. This paper develops the theory of pushdown dimension and explores its relationship with finitestate dimension.The pushdown dimension of any sequence ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
quantitative analogue of thewellknown fact that pushdown automata decide strictly more languages than finitestate
On Probabilistic Pushdown Automata
"... We study the most important probabilistic computation modes for pushdown automata. First we show that deterministic pushdown automata (pda) are weaker than Las Vegas pda, which in turn are weaker than onesidederror pda. Next onesidederror pda are shown to be weaker than (nondeterministic) pda. Fi ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We study the most important probabilistic computation modes for pushdown automata. First we show that deterministic pushdown automata (pda) are weaker than Las Vegas pda, which in turn are weaker than onesidederror pda. Next onesidederror pda are shown to be weaker than (nondeterministic) pda
Pushdown Specifications
, 2002
"... Traditionally, model checking is applied to finitestate systems and regular specifications. While researchers have successfully extended the applicability of model checking to infinitestate systems, almost all existing work still consider regular specification formalisms. There are, however, ma ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
, many interesting nonregular properties one would like to model check.
Bisimilarity of Pushdown Automata is
"... Abstract—Given two pushdown automata, the bisimilarity problem asks whether the infinite transition systems they induce are bisimilar. While this problem is known to be decidable our main result states that it is nonelementary, improving EXPTIMEhardness, which was the best previously known lower bo ..."
Abstract
 Add to MetaCart
Abstract—Given two pushdown automata, the bisimilarity problem asks whether the infinite transition systems they induce are bisimilar. While this problem is known to be decidable our main result states that it is nonelementary, improving EXPTIMEhardness, which was the best previously known lower
Timed pushdown automata revisited
"... Abstract—This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of densetimed PDA of Abdulla et al. collapses: it is expressively equivalent to densetimed PDA with timeless stack. Motivated by this result, we advocate the framewo ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of densetimed PDA of Abdulla et al. collapses: it is expressively equivalent to densetimed PDA with timeless stack. Motivated by this result, we advocate
Results 1  10
of
39,670