Skip to Main content Skip to Navigation
Conference papers

Push-Down Automata with Gap-Order Constraints

Abstract : We consider push-down automata with data (Pdad) that operate on variables ranging over the set of natural numbers. The conditions on variables are defined via gap-order constraint. Gap-order constraints allow to compare variables for equality, or to check that the gap between the values of two variables exceeds a given natural number. The messages inside the stack are equipped with values that are natural numbers reflecting their “values”. When a message is pushed to the stack, its value may be defined by a variable in the program. When a message is popped, its value may be copied to a variable. Thus, we obtain a system that is infinite in two dimensions, namely we have a stack that may contain an unbounded number of messages each of which is equipped with a natural number. We present an algorithm for solving the control state reachability problem for Pdad based on two steps. We first provide a translation to the corresponding problem for context-free grammars with data (Cfgd). Then, we use ideas from the framework of well quasi-orderings in order to obtain an algorithm for solving the reachability problem for Cfgds.
Document type :
Conference papers
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Wednesday, April 26, 2017 - 3:22:10 PM
Last modification on : Monday, October 29, 2018 - 10:08:13 AM
Long-term archiving on: : Thursday, July 27, 2017 - 12:50:16 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Parosh Abdulla, Mohamed Atig, Giorgio Delzanno, Andreas Podelski. Push-Down Automata with Gap-Order Constraints. 5th International Conference on Fundamentals of Software Engineering (FSEN), Apr 2013, Tehran, Iran. pp.199-216, ⟨10.1007/978-3-642-40213-5_13⟩. ⟨hal-01514667⟩



Record views


Files downloads