SearcharxivSearch

arXiv subjects

Ph. Schnoebelen

Publications and source records attributed to Ph. Schnoebelen.

2 recordsLinked to original sources

On Functions Weakly Computable by Pushdown Petri Nets and Related Systems

We consider numerical functions weakly computable by grammar-controlled vector addition systems (GVASes, a variant of pushdown Petri nets). GVASes can weakly compute all fast growing functions $F_α$ for $α<ω^ω$, hence they are computationally more powerful than standard vector addition systems. On the other hand they cannot weakly compute the inverses $F_α^{-1}$ or indeed any sublinear function. The proof relies on a pumping lemma for runs of GVASes that is of independent interest.

cs.FL

On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems

We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual convergence of fixpoint computations. In particular, we are able to directly obtain several new decidability results on lossy channel systems.

cs.SC