A Method for Stepwise Refinement and Abstraction of Petri Nets

@article{Suzuki1983AMF,
  title={A Method for Stepwise Refinement and Abstraction of Petri Nets},
  author={Ichiro Suzuki and Tadao Murata},
  journal={J. Comput. Syst. Sci.},
  year={1983},
  volume={27},
  pages={51-76}
}
This paper is concerned with a method for expanding (or reducing) a Petri net representation to the desired level of detail using step-by-step refinement of transitions and places (or abstraction of subnets to transitions). In particular, we present conditions under which a subnet can be substituted for a single transition while preserving properties such as liveness and boundedness. The present method is general enough to include previously reported methods as special cases. The refinement… CONTINUE READING
Highly Cited
This paper has 200 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 115 extracted citations

201 Citations

051015'86'93'01'09'17
Citations per Year
Semantic Scholar estimates that this publication has 201 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

B

  • W. BRAUER
  • RANDELL, AND C. A. PETRI (Eds.), “Net Theory and…
  • 1980

Marked graph transformations by stepwise transition refinements

  • SUZUKI, T. MURATA
  • “Proc. of the 18th Allerton Conf. on Comm…
  • 1980

Reduction and expansion of live and safe marked graphs

  • T. MURATA, J. Y. KOH
  • IEEE Trans. Circuits and Systems CAS-27,
  • 1980

T

  • AN R. JOHNSONBAUGH
  • MURATA, Analysis of resource requirements in…
  • 1980
1 Excerpt

M

  • R. JOHNSONBAUGH
  • C. KAO, AND T. MURATA, Additional transformations…
  • 1979

Y

  • AN T. AGERWALA
  • CHOED-AMPHAI, A synthesis rule for concurrent…
  • 1978

Similar Papers

Loading similar papers…