### 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 language | English |
---|---|

Pages (from-to) | 75-82 |

Number of pages | 8 |

Journal | SYST COMPUT CONTROLS |

Volume | 11 |

Issue number | 3 |

Publication status | Published - May 1980 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*SYST COMPUT CONTROLS*,

*11*(3), 75-82.

**COMPLEXITIES OF DECISION PROBLEMS FOR EQUIVALENCE AND SIMPLIFICATION OF SAFE PETRI NETS.** / Matsuura, Toshio; Sugiyama, Yuji; Taniguchi, Kenichi; Kasami, Tadao.

Research output: Contribution to journal › Article

*SYST COMPUT CONTROLS*, vol. 11, no. 3, pp. 75-82.

}

TY - JOUR

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

AU - Matsuura, Toshio

AU - Sugiyama, Yuji

AU - Taniguchi, Kenichi

AU - Kasami, Tadao

PY - 1980/5

Y1 - 1980/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0019010013&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019010013&partnerID=8YFLogxK

M3 - Article

VL - 11

SP - 75

EP - 82

JO - Systems, computers, controls

JF - Systems, computers, controls

SN - 0096-8765

IS - 3

ER -