2006•Modern ComputerRequires access

An Algorithm for Reachability Decision of Live Single Firing Petri-Nets

Chen Pinghua, Uk M

Abstract

Reachability decision problem is one of the most important topics in Petri nets theory. Some articles show that reachability of Petri nets can be studied with its reachability tree, but the limitless variable ?棕 in it bring the information losing during unbounded Petri nets running so that decision of its reachability can not be achieved. It is well known that deciding reachability of bounded Petri nets with its reachability tree is easy. But for lots of unbounded Petri nets finding an algorithm for its reachability decision is not easy. In this paper,we bring forward a subclass of Petri-Nets--single firing Petri-Nets,and propose an algorithm for its reachability decision.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Reachability, Petri net, Computer science, Stochastic Petri net, Reachability problem, Process architecture, Petri dish, Bounded function