Pushdown automaton

About: Pushdown automaton is a research topic. Over the lifetime, 1868 publications have been published within this topic receiving 35399 citations.

Algorithmic games for full ground references

Abstract: We present a full classification of decidable and undecidable cases for contextual equivalence in a finitary ML-like language equipped with full ground storage (both integers and reference names can be stored). The simplest undecidable type is unit→unit→unit. At the technical level, our results marry game semantics with automata-theoretic techniques developed to handle infinite alphabets. On the automata-theoretic front, we show decidability of the emptiness problem for register pushdown automata extended with fresh-symbol generation.

Composability of infinite-state activity automata

Abstract: Let ${\mathcal M}$ be a class of (possibly nondeterministic) language acceptors with a one-way input tape A system (A; A1, ..., Ar) of automata in ${\mathcal M}$, is composable if for every string w = a1 .. an of symbols accepted by A, there is an assignment of each symbol in w to one of the Ai's such that if wi is the subsequence assigned to Ai, then wi is accepted by Ai For a nonnegative integer k, a k-lookahead delegator for (A; A1, ..., Ar) is a deterministic machine D in ${\mathcal M}$ which, knowing (a) the current states of A, A1, ..., Ar and the accessible “local” information of each machine (e.g., the top of the stack if each machine is a pushdown automaton, whether a counter is zero on nonzero if each machine is a multicounter automaton, etc.), and (b) the k lookahead symbols to the right of the current input symbol being processed, can uniquely determine the Ai to assign the current symbol Moreover, every string w accepted by A is also accepted by D, i.e., the subsequence of string w delegated by D to each Ai is accepted by Ai Thus, k-lookahead delegation is a stronger requirement than composability, since the delegator D must be deterministic A system that is composable may not have a k-delegator for any k We look at the decidability of composability and existence of k-delegators for various classes of machines ${\mathcal M}$ Our results have applications to automated composition of e-services When e-services are modeled by automata whose alphabet represents a set of activities or tasks to be performed (namely, activity automata), automated design is the problem of “delegating” activities of the composite e-service to existing e-services so that each word accepted by the composite e-service can be accepted by those e-services collectively with each accepting a subsequence of the word, under possibly some Presburger constraints on the numbers and types of activities that can be delegated to the different e-services Our results generalize earlier ones (and resolve some open questions) concerning composability of deterministic finite automata as e-services to finite automata that are augmented with unbounded storage (e.g., counters and pushdown stacks) and finite automata with discrete clocks (i.e., discrete timed automata) We look at the decidability of composability and existence of k-delegators for various classes of machines ${\mathcal M}$ Our results have applications to automated composition of e-services E-services provide a general framework for discovery, flexible interoperation, and dynamic composition of distributed and heterogeneous processes on the Internet Automated composition allows a specified composite e-service to be implemented by composing existing e-services When e-services are modeled by automata whose alphabet represents a set of activities or tasks to be performed (namely, activity automata), automated design is the problem of “delegating” activities of the composite e-service to existing e-services so that each word accepted by the composite e-service can be accepted by those e-services collectively with each accepting a subsequence of the word, under possibly some Presburger constraints on the numbers and types of activities that can be delegated to the different e-services Our results generalize earlier ones (and resolve some open questions) concerning composability of deterministic finite automata as e-services to finite automata that are augmented with unbounded storage (e.g., counters and pushdown stacks) and finite automata with discrete clocks (i.e., discrete timed automata).

Winning Regions of Pushdown Parity Games: A Saturation Method

Abstract: We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the saturation technique to the parity condition. Finite word automata are used to represent sets of pushdown configurations. Starting from an initial automaton, we perform a series of automaton transformations to compute a fixed-point characterisation of the winning region. We introduce notions of under-approximation (soundness) and over-approximation (completeness) that apply to automaton transitions rather than runs, and obtain a clean proof of correctness. Our algorithm is simple and direct, and it permits an optimisation that avoids an immediate exponential blow up.

The equivalence problem for real-time DPDAs

Abstract: The equivalence problem for deterministic real-time pushdown automata is shown to be decidable. This result is obtained by showing that Valiant's parallel stacking technique using a replacement function introduced in this paper succeeds for deterministic real-time pushdown automata. Equivalence is also decidable for two deterministic pushdown automata, one of which is real-time.