Dependency analysis - a Petri net based technique for synthesizing large concurrent systems

Yigang Chen, T. Tsai

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

Petri nets (PN's) are frequently used in modeling, designing, and analyzing concurrent systems. A problem with PN's in the general case, is they require high computational complexity to analyze their properties such as reachability, liveness, and boundedness. To avoid this problem, synthesis techniques have been suggested for constructing large PN's. Using these techniques, the behavior of the constructed PN can be determined by local analysis which makes use of known properties of the given nets. Thus, the high computational complexity of global analysis is bypassed. This paper presents a new synthesis technique by exploring dependency relations in PN's. It synthesizes large PN's by combining smaller PN's of arbitrary topology structures, and the combination can be verified efficiently by dependency analysis. A large system based on PN can be built up by repeated applications of the technique.

Original languageEnglish (US)
Pages (from-to)414-426
Number of pages13
JournalIEEE Transactions on Parallel and Distributed Systems
Volume4
Issue number4
DOIs
StatePublished - Apr 1993
Externally publishedYes

Fingerprint

Concurrent Systems
Petri nets
Petri Nets
Computational complexity
Computational Complexity
Synthesis
Liveness
Global Analysis
Reachability
Boundedness
Topology
Arbitrary
Modeling

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Electrical and Electronic Engineering
  • Theoretical Computer Science

Cite this

Dependency analysis - a Petri net based technique for synthesizing large concurrent systems. / Chen, Yigang; Tsai, T.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 4, No. 4, 04.1993, p. 414-426.

Research output: Contribution to journalArticle

@article{75092c0809d1434bbcb1e69134728344,
title = "Dependency analysis - a Petri net based technique for synthesizing large concurrent systems",
abstract = "Petri nets (PN's) are frequently used in modeling, designing, and analyzing concurrent systems. A problem with PN's in the general case, is they require high computational complexity to analyze their properties such as reachability, liveness, and boundedness. To avoid this problem, synthesis techniques have been suggested for constructing large PN's. Using these techniques, the behavior of the constructed PN can be determined by local analysis which makes use of known properties of the given nets. Thus, the high computational complexity of global analysis is bypassed. This paper presents a new synthesis technique by exploring dependency relations in PN's. It synthesizes large PN's by combining smaller PN's of arbitrary topology structures, and the combination can be verified efficiently by dependency analysis. A large system based on PN can be built up by repeated applications of the technique.",
author = "Yigang Chen and T. Tsai",
year = "1993",
month = "4",
doi = "10.1109/71.219756",
language = "English (US)",
volume = "4",
pages = "414--426",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "4",

}

TY - JOUR

T1 - Dependency analysis - a Petri net based technique for synthesizing large concurrent systems

AU - Chen, Yigang

AU - Tsai, T.

PY - 1993/4

Y1 - 1993/4

N2 - Petri nets (PN's) are frequently used in modeling, designing, and analyzing concurrent systems. A problem with PN's in the general case, is they require high computational complexity to analyze their properties such as reachability, liveness, and boundedness. To avoid this problem, synthesis techniques have been suggested for constructing large PN's. Using these techniques, the behavior of the constructed PN can be determined by local analysis which makes use of known properties of the given nets. Thus, the high computational complexity of global analysis is bypassed. This paper presents a new synthesis technique by exploring dependency relations in PN's. It synthesizes large PN's by combining smaller PN's of arbitrary topology structures, and the combination can be verified efficiently by dependency analysis. A large system based on PN can be built up by repeated applications of the technique.

AB - Petri nets (PN's) are frequently used in modeling, designing, and analyzing concurrent systems. A problem with PN's in the general case, is they require high computational complexity to analyze their properties such as reachability, liveness, and boundedness. To avoid this problem, synthesis techniques have been suggested for constructing large PN's. Using these techniques, the behavior of the constructed PN can be determined by local analysis which makes use of known properties of the given nets. Thus, the high computational complexity of global analysis is bypassed. This paper presents a new synthesis technique by exploring dependency relations in PN's. It synthesizes large PN's by combining smaller PN's of arbitrary topology structures, and the combination can be verified efficiently by dependency analysis. A large system based on PN can be built up by repeated applications of the technique.

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

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

U2 - 10.1109/71.219756

DO - 10.1109/71.219756

M3 - Article

VL - 4

SP - 414

EP - 426

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 4

ER -