Abstract
Positive flows provide very useful informations that can be used to perform efficient analysis of a model. Although algorithms computing (a generative family of) positive flows in ordinary Petri nets are well known, computing a generative family of positive flows in colored net remains an open problem. We propose in this paper a pragmatic approach that allows us to define an algorithm that computes a generative family of particular but useful positive flows in a large subclass of colored nets: the simple well-formed nets.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Berthelot, G.: Checking properties of nets using transformations. In: Rozenberg, G. (ed.) Advances in Petri Nets 1985. LNCS, vol. 222, Springer, Heidelberg (1985)
Bruneton, E., Pradat-Peyre, J.F.: Automatic verification of concurrent ada programs. In: González Harbour, M., de la Puente, J.A. (eds.) Ada-Europe 1999. LNCS, vol. 1622, pp. 146–157. Springer, Heidelberg (1999)
Chiola, C., Dutheillet, C., Franceschinis, G., Haddad, S.: On well-formed colored nets and their symbolic reachability graph. In: ICATPN, Paris-France (June 1990)
Colom, J.M., Silva, M.: Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal P-semiflows. Lecture Notes in Computer Science. Advances in Petri Nets 1990, (NewsletterInfo: 33,390) vol. 483, pp. 79–112 (1991)
Couvreur, J.M., Haddad, S., Peyre, J.F.: Computation of generative families of positive semi-flows in two types of coloured nets. In: Proceedings of the 12th International Conference on Application and Theory of Petri Nets, Gjern, Denmark, pp. 122–144, NewsletterInfo: 39 (June 1991)
Couvreur, J.M., Haddad, S., Peyre, J.F.: Generative families of positive invariants in coloured nets sub-classes. In: Rozenberg, G. (ed.) Advances in Petri Nets 1993. LNCS, vol. 674, pp. 51–70. Springer, Heidelberg (1993)
Couvreur, J.M.: The general computation of flows for coloured nets. In: proc of the 11th International Conference on Application and Theory of Petri-Nets, Paris (June 1990)
Couvreur, J.M., Haddad, S.: Towards a general and powerful computation of flows for parameterized coloured nets. In: 9th European Workshop on Application and Theory of Petri Nets, vol. II, Venice (Italy) (June 1988)
Evangelista, S.: Helena, an efficient high level Petri nets analyser. Technical report, CEDRIC, CNAM, Paris (2004)
Evangelista, S., Haddad, S., Pradat-Peyre, J.F.: New coloured reductions for software validation. In: Workshop on Discrete Event Systems (2004)
Evangelista, S., Kaiser, C., Pajault, C., Pradat-Peyre, J.F., Rousseau, P.: Dynamic tasks verification with quasar. In: Vardanega, T., Wellings, A.J. (eds.) Ada-Europe 2005. LNCS, vol. 3555, Springer, Heidelberg (2005)
Evangelista, S., Kaiser, C., Pradat-Peyre, J.F., Rousseau, P.: Quasar: a new tool for analysing concurrent programs. In: Rosen, J.-P., Strohmeier, A. (eds.) Ada-Europe 2003. LNCS, vol. 2655, Springer, Heidelberg (2003)
Ezpeleta, J., García-Vallés, F., Colom, J.M.: A class of well structured petri nets for flexible manufacturing systems. In: Desel, J., Silva, M. (eds.) ICATPN 1998. LNCS, vol. 1420, pp. 64–83. Springer, Heidelberg (1998)
Garcia-Valles, F., Colom, J.M.: Implicit places in net systems. In: Proc. 8th Int. Workshop on Petri Net and Performance Models (PNPM’99), 8-10 October 1999, Zaragoza, Spain, pp. 104–113 (1999)
Genrich, H.J., Lautenbach, K.: S-invariance in predicate/transition nets. In: Pagnoni, A., Rozenberg, G. (eds.) Informatik-Fachberichte 66: Application and Theory of Petri Nets — Selected Papers from the Third European Workshop on Application and Theory of Petri Nets, Varenna, Italy, September 27–30, 1982, pp. 98–111. Springer-Verlag (1983)
Haddad, S., Girault, C.: Algebraic structure of flows of a regular coloured net. In: Rozenberg, G. (ed.) Advances in Petri Nets 1987. NewsletterInfo: 27, LNCS, vol. 266, pp. 73–88. Springer, Heidelberg (1987)
Haddad, S., Pradat-Peyre, J.-F.: New efficient petri nets reductions for parallel programs verification. Parallel Processing Letters 16(1), 101–116 (2006)
Hillah, L., Kordon, F., Petrucci-Dauchy, L., Trèves, N.: Pn standardisation: A survey. In: Najm, E., Pradat-Peyre, J.F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol. 4229, pp. 307–322. Springer, Heidelberg (2006)
Jensen, K.: Coloured Petri nets and the invariant method. T.C.S. 14, 317–336 (1981)
Memmi, G., Vautherin, J.: Computation of flows for unary-predicates/transition nets. In: Rozenberg, G. (ed.) Advances in Petri Nets 1984. LNCS, vol. 188, pp. 455–467. Springer, Heidelberg (1985)
Murata, T.: Petri nets: properties, analysis and applications. Proceedings of the IEEE 77(4), 39–50 (1989)
Pajault, C., Pradat-Peyre, J.F.: Distributed colored petri net model-checking with cyclades, LNCS vol. In: Brim, L., Haverkort, B., Leucker, M., van de Pol, J. (eds.) FMICS 2006 and PDMC 2006. LNCS, vol. 4346, Springer, Heidelberg (2007)
Reisig, W.: EATCS-An Introduction to Petri Nets. Springer, Heidelberg (1983)
Reisig, W.: Petri nets and algebraic specifications. Theoretical Computer Science, NewsletterInfo: 38,39, vol. 80, pp.1–34 (1991)
Silva Suarez, M., Martinez, J., Ladet, P., Alla, H.: Generalized inverses and the calculation of symbolic invariants for colored petri nets. Technique et Science Informatiques, NewsletterInfo: 16,21,22, vol. 4(1), pp. 113–126 (1985)
Vautherin, J.: Calculation of semi-flows for pr/T-systems. In: Int. Workshop on Petri Nets and Performance Models, Madison, Wisconsin, NewsletterInfo: 29, pp. 174–183. IEEE Computer Society Press, Washington (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Evangelista, S., Pajault, C., Pradat-Peyre, J.F. (2007). A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets. In: Derrick, J., Vain, J. (eds) Formal Techniques for Networked and Distributed Systems – FORTE 2007. FORTE 2007. Lecture Notes in Computer Science, vol 4574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73196-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-73196-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73195-5
Online ISBN: 978-3-540-73196-2
eBook Packages: Computer ScienceComputer Science (R0)