• Aucun résultat trouvé

On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems

N/A
N/A
Protected

Academic year: 2021

Partager "On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems"

Copied!
21
0
0

Texte intégral

Figure

Figure 1 Simulation of a d-counter machine M by a 1-dim 2-PVASS S. The stack alphabet Σ ⊆ ( Z ∪ {T}) d is the finite set of actions of M
Figure 2 A 1-dim 2-PVASS whose reduced reachability tree is infinite.

Références

Documents relatifs

Petri Nets, Vector Addition Systems (VAS), and Vector Addition Systems with control states (VASS) are equivalent well-known classes of counter systems for which the reachability

In more details, we define a notion of VAS coverability graphs that will constitute the models of our logic (Section 2) and investigate their simulation relations; we define an

Thanks to this approximation and since reachability sets are almost semilinear we finally prove in Section 9 that the vector addition system reachability problem can be decided

In order to estimate a music source at a given time-frequency point, KAM involves selecting a set of time-frequency bins, which, given the nature of the target source, e.g.,

We showed that the time needed for this process results principally from the vis- cous flow of the fluid into or out of the gap between pairs of almost contacting particles: it

In his view the centre of a school system should be an academic core for all students at different levels demanding disciplined learning under excellent

There is two kind of results: lemmas about reachability preservation by rewriting strategies, and corollaries about reduction of reachability decision problem for certain classes

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rhˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST