Advertisement

Five Classes of Invariant-Preserving Transformations on Colored Petri Nets

  • To-Yat Cheung
  • Yiqin Lu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1639)

Abstract

Transformations on a system specification are often used as a means for simplifying the process of verification. When applying a transformation, it is an important issue whether some specific properties of the system will be preserved or not. For systems specified in colored Petri nets, this paper provides the criteria for determining the preservation of place-invariants and transitioninvariants under five classes of very general transformations, namely, Insertion, Elimination, Replacement, Composition, and Decomposition. Applications to flexible manufacturing engineering systems and telecommunications systems are discussed.

Keywords

Flexible Manufacture System Incidence Matrix General Transformation Feature Interaction Deadlock Prevention 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M.L. Benalycherif and C. Girault, “Behavioural and structural composition rules preserving liveness by synchronization for colored FIFO nets”, Lecture Notes in Computer Science, Vol. 1091, Springer-Verlag, 1980, pp.73–92.Google Scholar
  2. [2]
    G. Berthelot, “Transformations and decompositions of nets”, Lecture Notes in Computer Science, Vol.254, Springer-Verlag, 1987, pp.359–376.Google Scholar
  3. [3]
    E. Best and T. Thielke, “Orthogonal transformations for colored Petri nets”, Lecture Notes in Computer Science, Vol.1248, Springer-Verlag, 1997, pp.447–466.Google Scholar
  4. [4]
    T.F. Bowen, F.S. Dworack, C.H. Chow, N. Griffeth, G.E. Herman, and Y.-J. Lin, “The feature interaction problem in telecommunications systems”, Proc. 7th IEE Int. Conf. on Software Engineering Telecomm. Switching Systems, 1989, pp.59–62.Google Scholar
  5. [5]
    E.J. Cameron, N. Griffeth, Y.J. Lin, M.E. Nilson, W.K. Schnure and H. Velthuijsen, “A feature-interaction benchmark for IN and beyond”, IEEE Communication Magazine, Vol.26, No.3, March, 1993, pp.64–69.CrossRefGoogle Scholar
  6. [6]
    T.Y. Cheung and Y. Lu, “Detecting and resolving the interaction between telephone features Terminating Call Screening and Call Forwarding by colored Petri-nets”, Proc. 1995 IEEE International Conference on Systems, Man and Cybernetics, Vancouver, Oct. 1995, pp.2245–2250.Google Scholar
  7. [7]
    T.Y. Cheung, “Petri nets for protocol engineering”, Journal of Computer Communications, Vol. 19, No. 14, Dec. 1996, pp.1250–1257.CrossRefGoogle Scholar
  8. [8]
    T.Y. Cheung and W. Zeng, “Invariant-preserving transformations for the verification of place/transition systems”, IEEE Trans. on System, Man and Cybernetics, Vol. 28, No.1, Jan. 1998, pp.114–221.CrossRefGoogle Scholar
  9. [9]
    T.Y. Cheung and Y. Lu, “A use case based approach to sythesis and analysis of flexible manufacturing systems”, Technical Report TR-98-12, Dept. of Computer Science, City University of Hong Kong, 1998.Google Scholar
  10. [10]
    S. Christensen and L. Petrucci, “Towards a modular analysis of coloured Petri nets”, Lecture Notes in Computer Science, Vol. 616, Springer-Verlag, 1992, pp.113–133.Google Scholar
  11. [11]
    J. Ezpeleta and J. M. Colom, “Automatic synthesis of colored Petri nets for the control of FMS”, IEEE Trans. Robotics and Automation, Vol. 13, No.3, June 1997, pp.327–337.CrossRefGoogle Scholar
  12. [12]
    S. Haddad, “A reduction theory for coloured nets”, Advances in Petri Nets 1989, Lecture Notes in Computer Science, Vol. 424, Springer-Verlag, 1990, pp.209–235.Google Scholar
  13. [13]
    K. Jensen, “How to find invariants for coloured Petri nets”, Lecture Notes in Computer Science, Vol. 118, Springer-Verlag, 1981, pp.327–338.Google Scholar
  14. [14]
    K. Jensen, “Coloured Petri nets: A high level language for system design and analysis”, Lecture Notes in Computer Science, Vol. 483, Springer-Verlag, 1990, pp.342–416.Google Scholar
  15. [15]
    M.D. Jeng and F. DiCesare, “A review of synthesis techniques for Petri nets with applications to automated manufacturing systems”, IEEE Trans. Systems, Man and Cybernetics, Vol. 23, No.1, Jan/Feb 1993, pp.301–312.zbMATHCrossRefMathSciNetGoogle Scholar
  16. [16]
    K. Jensen, Coloured Petri Net 3, Springer-Verlag, 1997.Google Scholar
  17. [17]
    Y. Kawarasaki and T Ohta, “A new proposal for feature interaction detection and elimination”, In Feature interactions in Telecommunication Systems III (K. E. Cheng and T. Ohta, eds.), IOS Press, 1995, pp. 127–139.Google Scholar
  18. [18]
    I. Koh and F. DiCesare, “Synthesis rules for colored Petri nets and their applications to automated manufacturing system”, Proc. 1991 IEEE International Symposium on Intelligent Control, Aug. Virginia, pp.152–157.Google Scholar
  19. [19]
    C. Lakos, “On the abstraction of coloured Petri nets”, Lecture Notes in Computer Science, Vol. 1248, Springer-Verlag, 1997, pp.42–61.Google Scholar
  20. [20]
    H.K. Lee, “Generalized Petri net reduction method”, IEEE Trans. System, Man, and Cybernetics, Vol. SMC-17, No.2, March/April 1987, pp.297–302.Google Scholar
  21. [21]
    Y. Lu and T. Y. Cheung, “Feature Interactions of the livelock type in IN: a detailed example”, Proc. 7th IEEE Intelligent Network Workshop, Bordeaux, 1998, pp.175–184.Google Scholar
  22. [22]
    M. Nakamura, Y. Kakuda and T. Kikuno, “Petri-net based detection method for nondeterministic feature interactions and its experimental evaluation”, In Feature Interactions in Telecommunications Systems IV (P. Dini, R. Boutaba and L. Logrippo, eds), IOS Press. 1997, pp. 138–152.Google Scholar
  23. [23]
    Y. Narahari and N. Viswanadham, “On the invariants of coloured Petri nets”, Lecture Notes in Computer Science, Vol. 222, Springer-Verlag, 1986, pp.330–345.Google Scholar
  24. [24]
    M. Silva and R. Valette, “Petri nets and flexible manufacturing”, Lecture Notes in Computer Science, Vol. 424. Springer-Verlag, 1990, pp.374–417.Google Scholar
  25. [25]
    M.C. Zhou, F. DiCesare, and A.A. Desrochers, “A hybrid methodology for synthesis of Petri net models for manufacturing systems”, IEEE Trans. Robotics and Automation, Vol. 8, No.3, Jun. 1992, pp.350–361.CrossRefGoogle Scholar
  26. [26]
    R. Zurawski, “Verifying correctness of interfaces of design models of manufacturing systems using functional abstractions”, IEEE Trans. Industrial Electronics, Vol.44, No.3, Jun. 1997, pp. 307–320.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • To-Yat Cheung
    • 1
  • Yiqin Lu
    • 2
  1. 1.Dept. of Computer Science CityUniversity of Hong KongHong KongChina
  2. 2.Dept. of Electronic EngineeringSouth China University of TechnologyGuangzhouChina

Personalised recommendations