Abstract
This paper deals with the compositionality of liveness when synchronizing two colored FIFO nets. The composition operator allows to merge transitions as well as some adjacent places or queues.
A behavioural sufficient condition for liveness compositionality relies on a mutual non constraining relation between component nets. A structural sufficient condition for synchronization preserving liveness is then considered in the case of a state machine at the interface of the merged elements with the non merged ones of each component net. It requires that the conflictual colored transitions of the interface state machines satisfy the structural freeing or blocking relations.
Finally an example shows how these conditions simplify the analysis of a protocol within a layered architecture.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. Bernardinello and F. De Cindio. A survey of basic net models and modular net classes. In Advances in Petri Nets 1992, volume 609 of LNCS. Springer-Verlag, 1992.
G. Berthelot. Checking Properties of Nets Using Transformations. In Advances in Petri Nets 1985, volume 222 of LNCS, pages 19–40. Springer Verlag, 1986.
J. Billington and D. Kinny. Computer Aided Protocol Engineering. In Conference on New Business Applications of Information Technology, pages 69–73, Melbourne, Australia, 1989.
G. Berthelot, G. Memmi, and W. Reisig. A Control Structure for Sequential Processes Synchronised by buffers. In Proc. of the 4th European Workshop on Application and Theory of Petri Nets. Toulouse, France, 1983.
A. Bourguet-Rouger and C. Girault. Validation of Parallel System Properties. In Proc. of International Conference on Parallel Processing and Applications, L'Aquila, Italy, 1987. North Holland.
J. Billington, G.R. Wheeler, and M.C. Wilburn-Ham. PROTEAN: A high-level petri net tool for the Specification and verification of Communication Protocols. IEEE Transactions on Software Engineering, 14(3):301–316, 1988.
A. Choquet. Analyse et propriétés des processus communiquant par files FIFO: réseaux à files à choix libre topologique et réseaux à files lineaires. Thèse de doctorat de 3ème cycle, Université Paris XI, 1987.
M. Diaz. Petri Net Based Models in the Specification and Verification of Protocols. In Advances in Petri Nets 1986, volume 255 of LNCS, pages 135–170. Springer Verlag, 1987.
J. Esparza and M. Silva. On the Analysis and Synthesis of Free Choice Systems. In Advances in Petri Nets 1990, volume 483 of LNCS. Springer Verlag, 1991.
J. Fanchon. Fifo-Net Models for Processes with Asynchronous Communication. In Proc. of the 12th International Conference on Application and Theory of Petri Nets, Gjern, Denmak, 1991.
A. Finkel. Structuration des systèmes de transitions — Application au contrôle du parallélisme par files FIFO. Thèse d'état, Université Paris XI, 1986.
G. Memmi. Méthodes d'analyse des Réseaux de Petri, Réseaux à files et Application aux Systèmes Temps Réel. Thèse d'état, Université Paris VI, 1983.
G. Memmi and A. Finkel. An Introduction to FIFO Nets-Monogeneous Net: A subclass of FIFO Nets. Theoretical Computer Science, 35:191–214, 1985.
Y. Souissi and G. Memmi. Composition of nets via a communication medium. In Proc. of the 10th International Conference on Application and Theory of Petri Nets, Bonn, 1989.
Y. Souissi. A Modular Approach for the Validation of Comunication Protocols using FIFO Nets. In Proc. of the XIth International Symposium on PSTV. North Holland, 1991.
E. Teruel and M. Suva. Liveness and Home States in Equal Conflict Systems. In Proc. of the 14th International Conference on Application and Theory of Petri Nets, Chicago, USA, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benalycherif, ML., Girault, C. (1996). Behavioural and structural composition rules preserving liveness by synchronization for colored FIFO nets. In: Billington, J., Reisig, W. (eds) Application and Theory of Petri Nets 1996. ICATPN 1996. Lecture Notes in Computer Science, vol 1091. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61363-3_5
Download citation
DOI: https://doi.org/10.1007/3-540-61363-3_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61363-3
Online ISBN: 978-3-540-68505-0
eBook Packages: Springer Book Archive