Abstract
The zero-test problem is a well-known limitation of Petri nets, and unfortunately it appears very frequently when reliable real-time systems are concerned. If the Petri net is bounded (it is generally the case when actual systems are specified), the zero-test problem can be solved by the introduction of complementary places. Nevertheless this solution presents three major drawbacks:
-
the specification becomes little readable,
-
the net can rarely be reduced,
-
the information given by the linear invariants does not take into account the elementary loops and therefore the zero-tests.
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.
Similar content being viewed by others
References
Lautenbach K., Schmid H.A. “Use of Petri nets for proving correctness of concurrent process systems” IFIP Congress, 1974, p. 187–191.
Latapie G. “Validation et mise en oeuvre de la synchronisation dans un système multiprocesseur à mémoire dupliquée” Thèse de Docteur de 3e cycle, Toulouse, 1980.
Berthelot G. “Vérification de réseaux de Petri” Thèse de Docteur de 3e cycle, Université Pierre et Marie Curie, Paris, 1978.
Keller R.M. “Formal verification of parallel programs” Com. ACM, July 1976, vol 19, N°7, p. 371–384.
Valette R., Diaz M. “A methodology for easily provable implementation of synchronization mechanisms” First Europ. Conf. on Parallel and Distributed Processing, Toulouse, 1979, p. 156–162.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valette, R. (1982). Petri Nets and Reliable Real-Time Systems. In: Girault, C., Reisig, W. (eds) Application and Theory of Petri Nets. Informatik-Fachberichte, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68353-4_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-68353-4_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11189-4
Online ISBN: 978-3-642-68353-4
eBook Packages: Springer Book Archive