## Decidability Issues for Petri Nets - a survey (1994)

Citations: | 90 - 5 self |

### BibTeX

@MISC{Esparza94decidabilityissues,

author = {Javier Esparza and Mogens Nielsen},

title = {Decidability Issues for Petri Nets - a survey},

year = {1994}

}

### Years of Citing Articles

### OpenURL

### Abstract

: We survey 25 years of research on decidability issues for Petri nets. We collect results on the decidability of important properties, equivalence notions, and temporal logics. 1. Introduction Petri nets are one of the most popular formal models for the representation and analysis of parallel processes. They are due to C.A. Petri, who introduced them in his doctoral dissertation in 1962. Some years later, and independently from Petri's work, Karp and Miller introduced vector addition systems [47], a simple mathematical structure which they used to analyse the properties of "parallel program schemata', a model for parallel computation. In their seminal paper on parallel program schemata, Karp and Miller studied some decidability issues for vector addition systems, and the topic continued to be investigated by other researchers. When Petri's ideas reached the States around 1970, it was observed that Petri nets and vector addition systems were mathematically equivalent, even though thei...