• Citer

A language-based comparison of extensions of petri nets with and without whole-place operations

par Abdulla, Parosh Aziz;Delzanno, Giorgio ;Van Begin, Laurent
Référence Lecture notes in computer science, 5457, page (71-82)
Publication Publié, 2009

Article révisé par les pairs

• Détails
• Contenu

Résumé :

We use language theory to study the relative expressiveness of infinite-state models laying in between finite automata and Turing machines. We focus here our attention on well structured transition systems that extend Petri nets. For these models, we study the impact of wholeplace operations like transfers and resets on nets with indistinguishable tokens and with tokens that carry data over an infinite domain. Our measure of expressiveness is defined in terms of the class of languages recognized by a given model using coverability of a configuration as accepting condition. © Springer-Verlag Berlin Heidelberg 2009.