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.
This work was performed when this author was a member of the Dpt. Ing. Eléctrica e Informática, Universidad de Zaragoza.
This work was partially supported by the DEMON Esprit Basic Research Action 3148
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
BERTHELOT, G.: Transformations et analyse de Réseaux de Petri. Application aux protocols, Thése d'Etat, Université P. et M. Curie (October 1983).
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)
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)
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).
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).
DESEL, J.: Reduction and Design of Well-behaved Concurrent Systems, in: CONCUR'90, Baeten, Klop eds., LNCS 458, Springer, pp. 166–181 (1990)
ESPARZA, J.; SILVA, M.: Circuits, handles, bridges and nets, 10th International Conference on Application and Theory of Petri Nets, Bad Godesberg (June 1989).
ESPARZA, J.: Structure theory of Free Choice nets. Ph. D. Thesis. University of Zaragoza (June 1990).
GENRICH, H.J.; THIAGARAJAN, P.S.: A theory of bipolar synchronisation schemes, Theoretical Computer Science, vol. 30, pp. 241–318 (1984).
HACK, M.H.T.: Analysis of production schemata by Petri Nets. TR-94. MIT. Boston (1972). Corrected June 1974.
JONES, N.; LANDWEBER, L.; LIEN, Y.: Complexity of some problems in Petri Nets, Theoretical Computer Science, vol. 4, pp. 277–299 (1977).
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.
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).
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).
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).
THIAGARAJAN, P.S.; VOSS, K.: A Fresh Look at Free Choice Nets, Information and Control, vol. 61, no 2, pp. 85–113 (1984).
VALETTE, R.: Analysis of Petri nets by stepwise refinements, Journal of Computer and System Science, vol. 18, pp. 35–46 (1979).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Esparza, J., Silva, M. (1991). Top-down synthesis of live and bounded free choice nets. In: Rozenberg, G. (eds) Advances in Petri Nets 1991. ICATPN 1990. Lecture Notes in Computer Science, vol 524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019972
Download citation
DOI: https://doi.org/10.1007/BFb0019972
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54398-5
Online ISBN: 978-3-540-47600-9
eBook Packages: Springer Book Archive