The search functionality is under construction.
The search functionality is under construction.

On Liveness of Time POC Nets with the Static Fair Condition

Atsushi OHTA, Tomiji HISAMURA

  • Full Text Views

    0

  • Cite this

Summary :

Petri net is a graphical and mathematical modeling tool for discrete event systems. This paper treats analysis problems of time Petri nets. In this model, a minimal and a maximal firing delays are assigned to each transition. If a transition is 'enabled' it can fire after minimal delay has passed and must fire before maximal delay has elapsed. Since time Petri net can simulate register machines, it has equivalent modeling power to that of Turing machine. It means, however, that most of the analysis problems of time Petri nets with general net structures are undecidable. In this paper, net structures are restricted to a subclass called partially ordered condition (POC) nets and dissynchronous choice (DC) nets. Firing delays are also restricted to satisfy 'static fair condition' which assures chance to fire for all transitions enabled simultaneously. First, a sufficient condition of liveness of time POC net with the static fair condition is derived. Then it is shown that liveness of time DC net with static fair condition is equivalent to liveness of the underlying nontime net. This means that liveness problem of this class is decidable. Lastly, liveness problem of extended free choice (EFC) net is shown to be decidable.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E82-A No.8 pp.1648-1655
Publication Date
1999/08/25
Publicized
Online ISSN
DOI
Type of Manuscript
PAPER
Category
Concurrent Systems

Authors

Keyword