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
Place of PublicationNew York, NY, USA
PublisherIEEE
Pages1960-1965
Number of pages6
ISBN (Print)0818607874
Publication statusPublished - 1987
Externally publishedYes

Fingerprint

Petri nets
Specifications
Heuristic algorithms

ASJC Scopus subject areas

  • Engineering(all)

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). New York, NY, USA: IEEE.

LIVENESS ANALYSIS OF SEQUENCE CONTROL SPECIFICATION DESCRIBED IN CAPACITY DESIGNATED PETRI NET USING REDUCTION. / Murata, Tomohiro; Komoda, Norihisa.

Unknown Host Publication Title. New York, NY, USA : IEEE, 1987. p. 1960-1965.

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

Murata, T & Komoda, N 1987, LIVENESS ANALYSIS OF SEQUENCE CONTROL SPECIFICATION DESCRIBED IN CAPACITY DESIGNATED PETRI NET USING REDUCTION. in Unknown Host Publication Title. IEEE, New York, NY, USA, pp. 1960-1965.
Murata T, Komoda N. LIVENESS ANALYSIS OF SEQUENCE CONTROL SPECIFICATION DESCRIBED IN CAPACITY DESIGNATED PETRI NET USING REDUCTION. In Unknown Host Publication Title. New York, NY, USA: IEEE. 1987. p. 1960-1965
Murata, Tomohiro ; Komoda, Norihisa. / LIVENESS ANALYSIS OF SEQUENCE CONTROL SPECIFICATION DESCRIBED IN CAPACITY DESIGNATED PETRI NET USING REDUCTION. Unknown Host Publication Title. New York, NY, USA : IEEE, 1987. pp. 1960-1965
@inproceedings{6837b77f8cbc4108ac436b0467c6cb40,
title = "LIVENESS ANALYSIS OF SEQUENCE CONTROL SPECIFICATION DESCRIBED IN CAPACITY DESIGNATED PETRI NET USING REDUCTION.",
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.",
author = "Tomohiro Murata and Norihisa Komoda",
year = "1987",
language = "English",
isbn = "0818607874",
pages = "1960--1965",
booktitle = "Unknown Host Publication Title",
publisher = "IEEE",

}

TY - GEN

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

AU - Murata, Tomohiro

AU - Komoda, Norihisa

PY - 1987

Y1 - 1987

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

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

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

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

M3 - Conference contribution

AN - SCOPUS:0023166843

SN - 0818607874

SP - 1960

EP - 1965

BT - Unknown Host Publication Title

PB - IEEE

CY - New York, NY, USA

ER -