A Perfect Class of Context-Sensitive Timed Languages

Bhave, Devendra; Dave, Vrunda; Krishna, Shankara Narayanan; Phawade, Ramchandra; Trivedi, Ashutosh

doi:10.1007/978-3-662-53132-7_4

Cited by 6 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This subclass is closed under union, intersection, complementation and determinization. The work presented in this paper extends the results from [8] for boundedround dt-ECMVPA to the case of bounded-scope dt-ECMVPA.…”

Section: Introductionsupporting

confidence: 58%

“…In [8] we have shown that k-round dt-ECMVPA are determinizable. Using an untiming construction to get k-round ECMVPA, determinize it and again converting this to get deterministic k-round dt-ECMVPA.…”

Section: Simulation Of Bmentioning

confidence: 92%

“…Proof (Proof sketch). Decidability of emptiness checking of k-round ECMVPA has been shown in [8]. This proof works for any general ECMVPA as the notion k-round has not been used.…”

Section: Emptiness Checking and Determinizability Of Scope-bounded Ecmentioning

confidence: 93%

“…We convert this back to get deterministic k-scope dt-MVPA. The morphisms used for this conversion are same as in [8].…”

Section: Simulation Of Bmentioning

confidence: 99%

See 3 more Smart Citations

On Timed Scope-Bounded Context-Sensitive Languages

Bhave

Krishna

Phawade

et al. 2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

In (DLT 2016) we studied timed context sensitive languages characterized by multiple stack push down automata (MPA), with an explicit bound on number of stages where in each stage at most one stack is used (k-round MPA). In this paper, we continue our work on timed MPA and study a subclass in which a symbol corresponding to a stack being pushed in it must be popped within fixed number of contexts of that stack -scope-bounded push-down automata with multiple stacks (k-scope MPA). We use Visibly Push-down Alphabet and Event Clocks to show that timed k-scope MPA have decidable reachability problem; are closed under Boolean operations; and have an equivalent logical characterization.

show abstract

Section: Introductionsupporting

confidence: 58%

Section: Simulation Of Bmentioning

confidence: 92%

“…Proof (Proof sketch). Decidability of emptiness checking of k-round ECMVPA has been shown in [8]. This proof works for any general ECMVPA as the notion k-round has not been used.…”

Section: Emptiness Checking and Determinizability Of Scope-bounded Ecmentioning

confidence: 93%

“…We convert this back to get deterministic k-scope dt-MVPA. The morphisms used for this conversion are same as in [8].…”

Section: Simulation Of Bmentioning

confidence: 99%

See 2 more Smart Citations

On Timed Scope-Bounded Context-Sensitive Languages

Bhave

Krishna

Phawade

et al. 2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…• Critical time constraints [8]. This is one of the timed examples, where we consider the language L crit = {a y b z c y d z | y, z ≥ 1} with time constraints between occurrences of symbols.…”

Section: Implementation and Experimentsmentioning

confidence: 99%

Revisiting Underapproximate Reachability for Multipushdown Systems

Akshay

Gastin

Krishna

et al. 2020

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Boolean programs with multiple recursive threads can be captured as pushdown automata with multiple stacks. This model is Turing complete, and hence, one is often interested in analyzing a restricted class which still captures useful behaviors. In this paper, we propose a new class of bounded underapproximations for multi-pushdown systems, which subsumes most existing classes. We develop an efficient algorithm for solving the under-approximate reachability problem, which is based on efficient fix-point computations. We implement it in our tool BHIM and illustrate its applicability by generating a set of relevant benchmarks and examining its performance. As an additional takeaway BHIM solves the binary reachability problem in pushdown automata. To show the versatility of our approach, we then extend our algorithm to the timed setting and provide the first implementation that can handle timed multipushdown automata with closed guards.

show abstract