ویراساینس.
سند علمی

Ramsey-Based Inclusion Checking for Dense-Stack Visibly Pushdown Automata

Devendra Bhave, Ramchandra Phawade

چکیده

Visibly pushdown automata are popular as they are closed under Boolean operations and determinization. There exist multiple notions of timed pushdown systems like recursive timed automata, densetime pushdown automata. We explore a generalization of visibly pushdown automata over infinite words with parity acceptance condition –in which stack elements have real valued time stamps–named dense-stack visibly pushdown automata. We prove its closure under union and intersection and show that inclusion checking for this class is decidable using Ramsey-based techniques.

اسناد مشابه

  • On the Expressive Power of 2-Stack Visibly Pushdown Automata

    سند علمی۲۰۰۸Logical Methods in Computer ScienceBenedikt Bollig

    Visibly pushdown automata are input-driven pushdown automata that recognize some non-regular context-free languages while preserving the nice closure and decidability properties of finite automata. Visibly pushdown automata with multiple stacks have been considered recently by La

  • Infinite games recognized by 2-stack visibly pushdown automata

    سند علمی۲۰۱۵Wenjuan Li, Shohei Okisaka, Kazuyuki Tanaka

    Two-player infinite games have been extensively studied in Descriptive Set Theory in the past several decades, accompanied by a celebrated result due to Martin that all Gale-Stewart games with Borel winning conditions are determined. In this paper, we are interested in the follow

  • A Logical Characterization for Dense-Time Visibly Pushdown Automata

    سند علمی۲۰۱۶LATADevendra Bhave, Vrunda Dave, Shankara Narayanan Krishna, Ramchandra Phawade

    Two of the most celebrated results that effectively exploit visual representation to give logical characterization and decidable modelchecking include visibly pushdown automata (VPA) by Alur and Madhusudan and event-clock automata (ECA) by Alur, Fix and Henzinger. VPA and ECA—by

  • Ordered multi-stack visibly pushdown automata

    مقاله‌ی دسترسی آزاد۲۰۱۶Theoretical Computer ScienceDarioCarotenuto, AnielloMurano, AdrianoPeron

  • Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation

    سند علمی۲۰۰۶CSLJirí Srba

    We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper

  • Beyond Language Equivalence on Visibly Pushdown Automata

    سند علمی۲۰۰۹Logical Methods in Computer ScienceJirí Srba

    We study (bi)simulation-like preorder/equivalence checking on visibly pushdown automata, visibly BPA (Basic Process Algebra) and visibly one-counter automata. We describe generic methods for proving complexity upper and lower bounds for a number of studied preorders and equivalen