Results 1  10
of
16,570
A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata
, 2012
"... ar ..."
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.
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
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
Heightdeterministic pushdown automata
 In 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS’07), volume 4708 of LNCS
, 2007
"... Abstract. We define the notion of heightdeterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on the input are a priori fixed. Different subclasses of heightdeterministic pushdown automata, strictly containing the cl ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Abstract. We define the notion of heightdeterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on the input are a priori fixed. Different subclasses of heightdeterministic pushdown automata, strictly containing
Model Checking Probabilistic Pushdown Automata
, 2004
"... We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be formulated as instances of a generalized random walk problem. We prove that both qualitative and quantitative model check ..."
Abstract

Cited by 79 (24 self)
 Add to MetaCart
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be formulated as instances of a generalized random walk problem. We prove that both qualitative and quantitative model
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
On Quantum Pushdown Automata
 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Lecture
, 1963
"... Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of quantum pushdown automata in a nonequivalent way, including unitarity criteria, by using the definition of quantum finite automata ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of quantum pushdown automata in a nonequivalent way, including unitarity criteria, by using the definition of quantum finite
Teams of Pushdown Automata
"... We introduce team pushdown automata as a theoretical framework capable of modelling various communication and cooperation strategies in complex, distributed systems. Team pushdown automata are obtained by augmenting distributed pushdown automata with the notion of team cooperation or  alternatively ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We introduce team pushdown automata as a theoretical framework capable of modelling various communication and cooperation strategies in complex, distributed systems. Team pushdown automata are obtained by augmenting distributed pushdown automata with the notion of team cooperation
Results 1  10
of
16,570