2010
DOI: 10.1007/978-3-642-14295-6_53
|View full text |Cite
|
Sign up to set email alerts
|

Global Reachability in Bounded Phase Multi-stack Pushdown Systems

Abstract: Bounded phase multi-stack pushdown systems (mpds) have been studied recently. Given a set C of configurations of a mpds M, let pre * M (C, k) be the set of configurations of M from which M can reach an element of C in at most k phases. In this paper, we show that for any mpds M, any regular set C of configurations of M and any number k, the set pre * M (C, k), is regular. We use saturation like method to construct a non-deterministic finite multi-automaton recognizing pre * M (C, k). Size of the automaton cons… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
18
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(18 citation statements)
references
References 12 publications
0
18
0
Order By: Relevance
“…In all these cases, the control state reachability problem is known to be decidable. Further, a stronger version known as the global reachability problem is also decidable -given a regular set of configurations compute the pre * of this set [2,3,16,24].…”
Section: Introductionmentioning
confidence: 99%
“…In all these cases, the control state reachability problem is known to be decidable. Further, a stronger version known as the global reachability problem is also decidable -given a regular set of configurations compute the pre * of this set [2,3,16,24].…”
Section: Introductionmentioning
confidence: 99%
“…Next, we state our main theorem which is a generalization of the result obtained in for bounded-phase visibly multi-stack pushdown automata [Set10].…”
mentioning
confidence: 78%
“…Symbolic representation of MPA configurations. We show in this section how we can symbolically represent infinite sets of multi-pushdown automaton configurations using special kind of finite automata which were introduced in [Set10]. Let M = (n, Q, Σ, Γ, ∆, q 0 , γ 0 , F ) be a multi-pushdown automaton.…”
Section: Ordered Multi-pushdown Automatamentioning
confidence: 99%
See 1 more Smart Citation
“…In [5], pure multi-pushdown automata that perform complete pushdown pops are introduced and studied. Papers [14,15,16,17] from the area of formal verification study multi-pushdown automata with ordered pushdowns, where the pop operation can be performed only on the first nonempty pushdown.…”
Section: Introductionmentioning
confidence: 99%