Abstract
This paper presents a survey of applications and theoretical properties of FIFO-nets, i.e. Place-Transition nets in which places behave as FIFO-queues rather than counters. In the first part, the adequacy of FIFO-nets for solving generic synchronization problems is shown and their impact on the fairness property of a concurrent system is discussed. The second part is devoted to the study of the computational power of this model as well as the characterization of some sub-classes for which some classical properties become decidable (liveness, boundedness). Finally, the notion of T-invariant for FIFO-nets is introduced.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
P. BEHM “RAFAEL: a tool for analyzing parallel systems in the L environment”. 6th European Workshop on applications and Theory of Petri-nets. Espoo 1985 pp227–254.
P.A. BERNSTEIN and N. GOODMAN “Concurrency Control in Distributed Data Base Systems”, Computing Surveys 13 (2) (1981) 185–221.
G.W. Brams “Réseaux de Petri: Théorie et Pratique”. Tome 1. Masson. Paris 1982
A. FINKEL “Control of a Petri net by a finite automaton”. 3rd Conf.on Fond. of Soft. Techn. and Theor. Comp. Sci. Bangalore 1983.
A. FINKEL “Boundedness and liveness for monogeneous FIFO nets and for free choice FIFO nets. Applications to analysis of protocols”. Internal report L.R.I. Universite Orsay Paris-Sud 1985.
A. FINKEL “Contrôle du parallélisme par file”. Thèse d'Etat Université Orsay Paris-Sud 1986.
M.P. FLE, G. ROUCAIROL “Fair Serializability of iterated Transactions using FIFO-nets”, Advanced in Petri-nets 84 Lect. Notes Comput. Sci. 188 (1984). 154–168.
M.P. FLE, G. ROUCAIROL “Multiserialization of iterated Transactions”, Information Processing Letters 18 (1984) 243–247.
M.P. FLE, G. ROUCAIROL Maximal Serializability of iterated Transaction”, Theoret. Comput. Sci. 38 (1985) 1–16.
M.P. FLE, G. ROUCAIROL “A language Theoretic Approach to Serialization Problem in Concurrent Systems”, Fundamentals of Computation Theory, (1985), Lect. Notes Comput. Sci. 199 pp.128–145.
R. M. KARP and R.E. MILLER “Parallel Program Schemata”, J.Comput, System Science. 3 (1969) 147–195.
R.M. KELLER “Parallel Program Schemata and Maximal Parallelism”, J. Asso, Comp, Mach 20 (3)(1973)514–537.
G. MEMMI and A. FINKEL “An introduction to FIFO-nets; monogeneous nets: a subclass of FIFO-nets”. Theoret, Comp. Sci. 35-1985 pp.191–214.
G. Memmi “Méthode d'analyse de Réseaux de Petri, Réseaux à Files, et Application aux systèmes temps réel”. Univ. Pierre et Marie Curie, Paris, Thèse de Doctorat d'Etat (1983).
G. ROUCAIROL “Mots de synchronisation”. RAIRO informatique 12 (4) 1978 pp.227–290.
G. ROUCAIROL “Transformations of sequential programs into parallel programs”. Parallel Processing Systems. An advanced course. D.J. Evans ed. Cambridge University Press 1982. (see also Thèse d'Etat. Paris. 1978).
R. VALK “Infinite behaviour and fairness”. In this course (1986).
B. VAUQUELIN and P. FRANCHI-ZANNETACCI “Automates a files”. Theoret. Compu. Sci. 11-1980 pp.221–225.
T.VUONG and D. COWAN “Reachability analysis of protocols with FIFO channels”. ACM SIGCOMM Symp. on Comm. Archi. and Protocols. Austin 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag
About this paper
Cite this paper
Roucairol, G., Bull, S.A. (1987). FIFO-nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds) Petri Nets: Central Models and Their Properties. Lecture Notes in Computer Science, vol 254. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0046849
Download citation
DOI: https://doi.org/10.1007/BFb0046849
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17905-4
Online ISBN: 978-3-540-47919-2
eBook Packages: Springer Book Archive