Advertisement

Top-down synthesis of live and bounded free choice nets

  • Javier Esparza
  • Manuel Silva
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 524)

Abstract

The paper provides a set of rules for the stepwise synthesis of all and only live and bounded Free Choice nets. The starting point are nets composed by a circuit containing one place and one transition.

Keywords

Free Choice nets synthesis structure theory 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BERT 83]
    BERTHELOT, G.: Transformations et analyse de Réseaux de Petri. Application aux protocols, Thése d'Etat, Université P. et M. Curie (October 1983).Google Scholar
  2. [BERT 87]
    BERTHELOT, G.: Transformations and Decompositons of Nets, in: Petri Nets: Central Models and their Properties, Brauer, Reisig, Rozenberg eds., LNCS 254, Springer, pp. 359–376 (1987)Google Scholar
  3. [BEST 87]
    BEST, E.: Structure Theory of Petri Nets: The Free Choice Hiatus, in: Petri Nets: Central Models and their Properties, Brauer, Reisig, Rozenberg eds., LNCS 254, Springer, pp. 167–205 (1987)Google Scholar
  4. [BETH 87]
    BEST, E.; THIAGARAJAN, P.S.: Some classes of live and safe Petri Nets, in: Concurrency and nets, Voss, Genrich, Rozenberg eds., Springer, pp. 71–94(1987).Google Scholar
  5. [COSI 89]
    COLOM, J.M.; SILVA, M.: Improving the linearly based Characterization of P/T nets, 10th International Conference on Application and Theory of Petri Nets, Bad Godesberg (June 1989).Google Scholar
  6. [DESE 90]
    DESEL, J.: Reduction and Design of Well-behaved Concurrent Systems, in: CONCUR'90, Baeten, Klop eds., LNCS 458, Springer, pp. 166–181 (1990)Google Scholar
  7. [ESSI 89]
    ESPARZA, J.; SILVA, M.: Circuits, handles, bridges and nets, 10th International Conference on Application and Theory of Petri Nets, Bad Godesberg (June 1989).Google Scholar
  8. [ESPA 90]
    ESPARZA, J.: Structure theory of Free Choice nets. Ph. D. Thesis. University of Zaragoza (June 1990).Google Scholar
  9. [GETH 84]
    GENRICH, H.J.; THIAGARAJAN, P.S.: A theory of bipolar synchronisation schemes, Theoretical Computer Science, vol. 30, pp. 241–318 (1984).Google Scholar
  10. [HACK 72]
    HACK, M.H.T.: Analysis of production schemata by Petri Nets. TR-94. MIT. Boston (1972). Corrected June 1974.Google Scholar
  11. [JOLL 77]
    JONES, N.; LANDWEBER, L.; LIEN, Y.: Complexity of some problems in Petri Nets, Theoretical Computer Science, vol. 4, pp. 277–299 (1977).Google Scholar
  12. [KOVA 91]
    KOVALYOV, A.V.: On Complete Reducibility of Some Classes of Petri Nets, 12th International Conference on Application and Theory of Petri Nets, Paris (June 1989). See also this volume.Google Scholar
  13. [MERO 80]
    MEMMI, G.; ROUCAIROL, G.: Linear Algebra in Net Theory, in: Net Theory and Applications, Proc. of the first Advanced Course on General Net Theory of Systems and Processes, Brauer ed., LNCS 84, Springer, pp. 213–223 (1980).Google Scholar
  14. [SILV 81]
    SILVA, M.: Sur le concept de macroplace et son utilisation pour lánalyse des réseaux de Petri, R.A.I.R.O., vol. 15, no 4, pp. 335–345 (1981).Google Scholar
  15. [SUMU 83]
    SUZUKI, I.; MURATA, T.: A method for Stepwise Refinements and Abstractions of Petri Nets, Journal of Computer and System Science, vol. 27, no 1, pp. 51–76 (1983).Google Scholar
  16. [THVO 84]
    THIAGARAJAN, P.S.; VOSS, K.: A Fresh Look at Free Choice Nets, Information and Control, vol. 61, no 2, pp. 85–113 (1984).Google Scholar
  17. [VALE 79]
    VALETTE, R.: Analysis of Petri nets by stepwise refinements, Journal of Computer and System Science, vol. 18, pp. 35–46 (1979).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Javier Esparza
    • 1
  • Manuel Silva
    • 2
  1. 1.Institut für InformatikUniversität HildesheimHildesheimGermany
  2. 2.Dpt. de Ingeniería Eléctrica e InformáticaUniversidad de ZaragozaZaragozaSpain

Personalised recommendations