HAL: hal-00686444, version 1

Detailed view

Export this paper BibTeX - EndNote - TEI - RefWorks -

Available versions:

v1 (2012-04-10)

v2 (2012-10-16)

Vector Addition Systems with States vs. Petri nets

Avellaneda Florent (  Corresponding author ) 1, Rémi Morin 1

(2012-04-10)

Vector addition systems with states are known to be computationally equivalent to Petri nets. In this paper we compare these two models with respect to the non-branching process semantics based on labeled occurrence nets. We investigate first some basic problems such as reachability, boundedness and covering, when one considers the markings reached by the prefixes of the processes accepted by some vector addition system with states. By means of a new simulation by a Petri net, we prove that these problems are computationally equivalent to the analogous problems for Petri nets. Second, based on some undecidability result from Mazurkiewicz trace theory, we show that one cannot check effectively whether a vector addition system with states is semantically equivalent to some Petri net, even for systems whose prefix-reachable markings are bounded.

1:	Laboratoire d'informatique Fondamentale de Marseille (LIF)
	CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I

Subject

:

Computer Science/Computation and Language

Keyword(s): Petri nets – vector addition systems with states – non-branching process semantics – reachability – boundedness – covering – Mazurkiewicz traces – universality problem

hal-00686444, version 1

http://hal.archives-ouvertes.fr/hal-00686444

oai:hal.archives-ouvertes.fr:hal-00686444

From: Rémi Morin <>

Submitted on: Tuesday, 10 April 2012 11:48:06

Updated on: Tuesday, 10 April 2012 14:59:35