Abstract
Live and safe free choice nets constitute an attractive class of Petri nets. This is evidenced by the fundamental results worked out by Hack. There are some essential additional properties which make them even more appealing. In this paper we bring out these additional structural and behavioural properties. We shall also argue that these properties are what makes live and safe free choice nets fly. We show through examples that each such property breaks down for a “next” larger class of nets called simple nets.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Best, E.; Shields, M.W.: Some Equivalence Results for Free Choice and Simple Nets and on the Periodicity of Live Free Choice Nets. Proc. CAAP 83, 8th Colloquium on Trees in Algebra and Programming, L'Aquila, March 9–11, 1983, 14 pp.
Brauer, W. (ed.): Net Theory and Applications. Lecture Notes in Computer Science 84. Springer-Verlag, Berlin Heidelberg New York, 1980
Commoner, F.: Deadlocks in Petri Nets. Wakefield, Applied Data Research Inc., CA-7206-2311, 1972
Commoner, F.; Holt, A.W.; Even, S.; Pnueli, A.: Marked Directed Graphs. J. Computer and System Science 5, 1971, pp. 511–523
Genrich, H.J.; Lautenbach, K.: Synchronisationsgraphen. Acta Informatica 2, 1973, pp. 143–161
Genrich, H.J.; Stankiewicz-Wiechno, E.: A Dictionary of some Basic Notions of Net Theory. In pp. 519–535
Genrich, H.J.; Thiagarajan, P.S.: A Theory of Bipolar Synchronisation Schemes. Report DAIMI PB-158, Aarhus University, March 1983, 130 pp. Also to appear in TCS.
Hack, M.H.T.: Analysis of Production Schemata by Petri Nets. Project MAC, Massachusetts Institute of Technology. Cambridge, Massachusetts, Feb. 1972, 119 pp.
Holt, A.W.: Final Report for the Project ‘Development of the Theoretical Foundations for Description and Analysis of Discrete Information Systems'. Wakefield, Mass., Massachusetts Computer Associates Inc., 20.5.1974
Jantzen, M.; Valk, R.: Formal Properties of Place/Transition Nets. In pp. 165–212
Queille, J.P.; Sifakis, J.: A Temporal Logic to Deal with Fairness in Transition Systems. Proc. of 23. FoCS, 1982, pp. 217–225. Also to appear in Acta Informatica.
Shields, M.W.: On the Non-Sequential Behaviour of Systems Possessing a Generalised Free Choice Property. Internal Report CRS-92-81, Edinburgh University, Sept. 1981.
Thiagarajan, P.S.; Voss, K.: A Fresh Look at Free Choice Nets. Arbeitspapiere der GMD, Nr. 58, St. Augustin, Oct. 1983, 42 pp. Also to appear in Information and Control.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thiagarajan, P.S., Voss, K. (1985). In praise of free choice nets. In: Rozenberg, G. (eds) Advances in Petri Nets 1984. Lecture Notes in Computer Science, vol 188. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15204-0_24
Download citation
DOI: https://doi.org/10.1007/3-540-15204-0_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15204-0
Online ISBN: 978-3-540-39320-7
eBook Packages: Springer Book Archive