Some Decidability Results for Nested Petri Nets

  • Authors:
  • Irina A. Lomazova;Ph. Schnoebelen

  • Affiliations:
  • -;-

  • Venue:
  • PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

Nested Petri nets are Petri nets using other Petri nets as tokens, thereby allowing easy description of hierarchical systems. Their nested structure makes some important verification problems undecidable (reachability, boundedness, . . . ) while some other problems remain decidable (termination, inevitability, . . . ).