Skip to main content
Book Chapter

Decidability and complexity of Petri net problems — An introduction

  • Esparza J
DOI: 10.1007/3-540-65306-6_20
N/ACitations
Citations of this article
74Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A collection of 10 "rules of thumb" is presented that helps to determine the decidability and complexity of a large number of Petri net problems.

Cite

CITATION STYLE

APA

Esparza, J. (1998). Decidability and complexity of Petri net problems — An introduction (pp. 374–428). https://doi.org/10.1007/3-540-65306-6_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free