Search

• < Previous
• 1
• Next >

---

Reasoning about Data Repetitions with Counter Systems

Stephane Demri ; Diego Figueira ; M Praveen.

We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or past. We demonstrate correspondences between satisfiability&nbsp;[&hellip;]

---

On Functions Weakly Computable by Pushdown Petri Nets and Related Systems

J. Leroux ; M. Praveen ; Ph. Schnoebelen ; G. Sutre.

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_\alpha$ for $\alpha<\omega^\omega$, hence they are computationally more powerful than standard vector&nbsp;[&hellip;]

---