Filters








56 Hits in 6.4 sec

Two-Way Parikh Automata with a Visibly Pushdown Stack [chapter]

Luc Dartois, Emmanuel Filiot, Jean-Marc Talbot
2019 Green Chemistry and Sustainable Technology  
In this paper, we investigate the complexity of the emptiness problem for Parikh automata equipped with a pushdown stack.  ...  If the input head can move in a two-way fashion, emptiness gets undecidable, even if the pushdown stack is visibly and the automaton deterministic.  ...  Two-Way Visibly Pushdown (Parikh) Automata In this section, we first recall the definition of two-way visibly pushdown automata and later on extend them to two-way visibly pushdown Parikh automata.  ... 
doi:10.1007/978-3-030-17127-8_11 dblp:conf/fossacs/DartoisFT19 fatcat:ux3ozqxv3zcofaxodgyualgn5q

A Robust Class of Context-Sensitive Languages

Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato
2007 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)  
This class, called multi-stack visibly pushdown languages (MVPLs), is defined using multi-stack pushdown automata with two restrictions: (a) the pushdown automaton is visible, i.e. the input letter determines  ...  We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolean operations.  ...  The class of languages we study in this paper is defined using visibly pushdown automata working with multiple stacks.  ... 
doi:10.1109/lics.2007.9 dblp:conf/lics/TorreMP07 fatcat:pb5fd235x5ayffguy7wax2xwvm

Properties of Visibly Pushdown Transducers [chapter]

Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
2010 Lecture Notes in Computer Science  
Visibly pushdown transducers form a subclass of pushdown transducers that (strictly) extends finite state transducers with a stack.  ...  Like visibly pushdown automata, the input symbols determine the stack operations. In this paper, we prove that functionality is decidable in PSpace for visibly pushdown transducers.  ...  Visibly pushdown automata (VPAs), that characterize VPLs, are obtained as a restriction of pushdown automata. In these automata the input symbols determine the stack operations.  ... 
doi:10.1007/978-3-642-15155-2_32 fatcat:5habb7auyvgszc6xxchsbddvaq

The Language Theory of Bounded Context-Switching [chapter]

Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato
2010 Lecture Notes in Computer Science  
the stack operations are made visible (as in visibly pushdown automata).  ...  Concurrent compositions of recursive programs with finite data are a natural abstraction model for concurrent programs.  ...  A visibly pushdown automaton [1] is an Mvpa with just one stack. Definition 2. (Visibly pushdown automaton) A visibly pushdown automaton, denoted Vpa, is an Mvpa over Σ n with n = 1.  ... 
doi:10.1007/978-3-642-12200-2_10 fatcat:ynrex6cyznghhehsvzulsrefyu

Synchronization of Pushdown Automata [chapter]

Didier Caucal
2006 Lecture Notes in Computer Science  
The visibly pushdown automata are the automata synchronized by an one state transducer whose output labels are −1, 0, 1.  ...  We introduce the synchronization of a pushdown automaton by a sequential transducer associating an integer to each input word.  ...  It appears that the closure results for the languages accepted by the visibly pushdown automata are based on a geometrical property of their graphs with regard to the stack height.  ... 
doi:10.1007/11779148_12 fatcat:5n3xu55gqjcrjl3uodfmzatsf4

Verifying Quantitative Temporal Properties of Procedural Programs

Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan, Michael Wagner
2018 International Conference on Concurrency Theory  
On one side, we define Constrained Pushdown Systems (CPDS), an extension of pushdown systems with constraints, expressed in Presburger arithmetics, on the numbers of occurrences of each symbol in the alphabet  ...  within invocation intervals (subcomputations between matching pushes and pops), and on the other side, we introduce a higher level specification language that is a quantitative extension of CaRet (the  ...  Not a CFL, not recognized by Parikh Automata, recognized by Parikh Pushdown Automata [20, 21] L * 1 , L * 2 . Unlikely to be recognizable by Parikh Pushdown Automata.  ... 
doi:10.4230/lipics.concur.2018.15 dblp:conf/concur/AtigBKS18 fatcat:35x36xyndje3rpt6liyzrdjveu

Scope-Bounded Pushdown Languages [chapter]

Salvatore La Torre, Margherita Napoli, Gennaro Parlato
2014 Lecture Notes in Computer Science  
We study the formal language theory of multistack pushdown automata (Mpa) restricted to computations where a symbol can be popped from a stack S only if it was pushed within a bounded number of contexts  ...  We contribute to show that scoped Mpa are indeed a robust model of computation, by focusing on the corresponding theory of visibly Mpa (Mvpa).  ...  contexts of a same stack can be captured.  ... 
doi:10.1007/978-3-319-09698-8_11 fatcat:7tiov2siszdojlb7xrdrtomduy

Scope-Bounded Pushdown Languages

Salvatore La Torre, Margherita Napoli, Gennaro Parlato
2016 International Journal of Foundations of Computer Science  
We study the formal language theory of multistack pushdown automata (Mpa) restricted to computations where a symbol can be popped from a stack S only if it was pushed within a bounded number of contexts  ...  We contribute to show that scoped Mpa are indeed a robust model of computation, by focusing on the corresponding theory of visibly Mpa (Mvpa).  ...  contexts of a same stack can be captured.  ... 
doi:10.1142/s0129054116400074 fatcat:uukwmezptvfo3ovcvtt266smcy

Propositional Dynamic Logic with Recursive Programs [chapter]

Christof Löding, Olivier Serre
2006 Lecture Notes in Computer Science  
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan 2004).  ...  Another possible direction for future research is to combine visibly pushdown automata with the game logic of Parikh [12] . - S ⊆ [k] * is a non-empty, prefix closed set (with [k] = {0, . . . , k − 1}  ...  Then we introduce visibly pushdown automata and use them to extend PDL with more powerful programs.  ... 
doi:10.1007/11690634_20 fatcat:ocnydetcobdknjl3azko73i2ha

The tree width of auxiliary storage

P. Madhusudan, Gennaro Parlato
2011 Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '11  
We propose a generalization of results on the decidability of emptiness for several restricted classes of sequential and distributed automata with auxiliary storage (stacks, queues) that have recently  ...  Our results outline a uniform mechanism to derive emptiness algorithms for automata, explaining and simplifying several existing results, as well as proving new decidability results.  ...  The idea of interpreting stacks as nesting edges was motivated by the work relating visibly pushdown automata with nested word automata [1] [2] [3] , where nesting edges capture a visible stack.  ... 
doi:10.1145/1926385.1926419 dblp:conf/popl/MadhusudanP11 fatcat:oahcnyhh25ehdmfavwnp6vdmtu

The tree width of auxiliary storage

P. Madhusudan, Gennaro Parlato
2011 SIGPLAN notices  
We propose a generalization of results on the decidability of emptiness for several restricted classes of sequential and distributed automata with auxiliary storage (stacks, queues) that have recently  ...  Our results outline a uniform mechanism to derive emptiness algorithms for automata, explaining and simplifying several existing results, as well as proving new decidability results.  ...  The idea of interpreting stacks as nesting edges was motivated by the work relating visibly pushdown automata with nested word automata [1] [2] [3] , where nesting edges capture a visible stack.  ... 
doi:10.1145/1925844.1926419 fatcat:vdsmn24g25a5tjis3fw7z7jfwy

On the Decidability of Model-Checking Information Flow Properties [chapter]

Deepak D'Souza, Raveendra Holla, Janardhan Kulkarni, Raghavendra K. Ramesh, Barbara Sprick
2008 Lecture Notes in Computer Science  
In this paper, we show that verifying these BSPs for the more expressive system model of pushdown systems is undecidable.  ...  We also give an example of a simple security property which is undecidable even for finite-state systems: the property is a weak form of non-inference called WNI, which is not expressible in Mantel's BSP  ...  A nondeterminstic pushdown automata P with a single state q, accepting by empty stack, with S (starting non-terminal in G) as the initial stack symbol, accepting exactly L(G) can be constructed [?]  ... 
doi:10.1007/978-3-540-89862-7_2 fatcat:o5iutbtu7bfebgler67s4ipcce

Beyond Regularity for Presburger Modal Logic

Facundo Carreiro, Stéphane Demri
2012 Advances in Modal Logic  
In this paper, we consider its extension with nonregular constraints, and more specifically those expressed by visibly pushdown languages (VPL).  ...  However, the presence of two VPL-contraints or the presence of a negative occurrence of a single VPL-constraint leads to undecidability.  ...  A visibly pushdown language (VPL) is a language accepted by a VPA.  ... 
dblp:conf/aiml/CarreiroD12 fatcat:4reliqw4lnfanlxtudl2ydglgm

Regular Separability and Intersection Emptiness Are Independent Problems

Ramanathan S. Thinniyam, Georg Zetzsche, Michael Wagner
2019 Foundations of Software Technology and Theoretical Computer Science  
This was recently strengthened to undecidability already for visibly pushdown languages [28] and one-counter languages [29] .  ...  The problem of regular separability asks, given two languages K and L, whether there exists a regular language S that includes K and is disjoint from L.  ...  Higher-order pushdown automata operate on higher-order stacks by way of instructions.  ... 
doi:10.4230/lipics.fsttcs.2019.51 dblp:conf/fsttcs/ThinniyamZ19 fatcat:rklvkbma6jcexd55xddgo4glsu

Propositional dynamic logic with recursive programs

Christof Löding, Carsten Lutz, Olivier Serre
2007 The Journal of Logic and Algebraic Programming  
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata [R. Alur, P.  ...  Specifically, we consider the class of visibly pushdown languages [3], i.e., languages that can be accepted by a visibly pushdown automaton (Vpa).  ...  Another possible direction for future research is to combine visibly pushdown automata with the game logic of Parikh [17] . • R(ϕ?) = {(s, s) | M, s |= ϕ} for a test ϕ?  ... 
doi:10.1016/j.jlap.2006.11.003 fatcat:ytjzzbg27vadhkjuxulwbr6fsu
« Previous Showing results 1 — 15 out of 56 results