LIVENESS ANALYSIS OF SEQUENCE CONTROL SPECIFICATION DESCRIBED IN CAPACITY DESIGNATED PETRI NET USING REDUCTION.

Tomohiro Murata, Norihisa Komoda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

The capacity-designated Petri net (CPN), in which each of the places can have at most a designated number of tokens, is a suitable model for describing real system behavior. Liveness analysis of CPN is important to guarantee that a system described using a CPN is deadlock free. The CPN liveness problem can be completely determined by reachability tree analysis, but it needs a large amount of calculation time in proposition to net size power. Three reduction rules are proposed which can be directly applied to the CPN model and preserve the liveness property of original net. The heuristic algorithms for realizing the reduction rules are also proposed, and an example of the reduction process using these algorithms is demonstrated.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages1960-1965
Number of pages6
ISBN (Print)0818607874
Publication statusPublished - 1987 Jan 1
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'LIVENESS ANALYSIS OF SEQUENCE CONTROL SPECIFICATION DESCRIBED IN CAPACITY DESIGNATED PETRI NET USING REDUCTION.'. Together they form a unique fingerprint.

  • Cite this

    Murata, T., & Komoda, N. (1987). LIVENESS ANALYSIS OF SEQUENCE CONTROL SPECIFICATION DESCRIBED IN CAPACITY DESIGNATED PETRI NET USING REDUCTION. In Unknown Host Publication Title (pp. 1960-1965). IEEE.