| | |
Summary: A Language-Based Comparison of Extensions of
Petri Nets with and without Whole-Place
Operations
Parosh Aziz Abdulla1
, Giorgio Delzanno2
, and Laurent Van Begin3
1
Uppsala University, Sweden, parosh@it.uu.se
2
Universit`a di Genova, Italy, giorgio@disi.unige.it
3
Universit´e Libre de Bruxelles, Belgium, lvbegin@ulb.ac.be
Abstract. We use language theory to study the relative expressiveness
of infinite-state models laying in between finite automata and Turing ma-
chines. We focus here our attention on well structured transition systems
that extend Petri nets. For these models, we study the impact of whole-
place 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 ac-
|
