2005•Unpublished venueRequires access

Minimal Time Reachability Problem of Some Subclasses of Timed Petri Nets

Akinori Ohta, Kohkichi Tsuji, Tomiji Hisamura

Abstract

Timed Petri net is an effective tool to evaluate discrete event systems. This paper treats the reachability problem of timed Petri nets. The problem aims to find the firing sequence which drives the initial marking M/sub 0/ to the target marking M/sub f/ in minimal execution time. First, we consider the subclass in which non-delayed sequence gives the optimal solution. Then, an algorithm is proposed to solve the minimal time reachability problem of timed state machines.

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, Reachability problem, Computer science, Sequence (biology), Stochastic Petri net, State (computer science), Event (particle physics)