COMPLEXITIES OF DECISION PROBLEMS FOR EQUIVALENCE AND SIMPLIFICATION OF SAFE PETRI NETS.

Toshio Matsuura, Yuji Sugiyama, Kenichi Taniguchi, Tadao Kasami

Research output: Contribution to journalArticle

Abstract

The decision problem is shown, given two sets of firing sequences by safe petri nets (sets of t-nodes sequences but each of t-nodes has a different name) and for simplification of safe Petri nets. In order to resolve the decision problems for equivalence and simplification of the set of labeled sequences corresponding firing sequences for the labeled safe Petri net with label of each t-nodes (there may be same labels in different t-nodes), it is shown that they all require a given Petri net exponential space in the size of the net (sum of nodes and arcs) for the given petri net.

Original languageEnglish
Pages (from-to)75-82
Number of pages8
JournalSystems, computers, controls
Volume11
Issue number3
Publication statusPublished - Jan 1 1980

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Matsuura, T., Sugiyama, Y., Taniguchi, K., & Kasami, T. (1980). COMPLEXITIES OF DECISION PROBLEMS FOR EQUIVALENCE AND SIMPLIFICATION OF SAFE PETRI NETS. Systems, computers, controls, 11(3), 75-82.