Abstract
The new class of Well Formed Coloured Nets (WN) is formally defined as an extension of Regular Nets (RN), together with an extended Symbolic Reachability Graph (SRG) construction algorithm. WNs allow the representation of any colour function in a structured form, so that they have the same modelling power as general coloured nets (CPN). In particular, with respect to RN, WNs allow the use of non-symmetric initial markings, of repeated occurrences of the same basic class in the Cartesian product defining the colours for transitions and places, and of the “constant” and “successor” functions as arc labels. The SRG allows colour symmetries to be exploited to reduce the space and time complexity of the analysis by reachability graph. The advantage of using WNs instead of unconstrained CPNs is that the detection of symmetries to construct the SRG is totally algorithmic, and requires no special heuristics.
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.
References
M. Ajmone Marsan, G. Balbo, and G. Conte. A class of generalized stochastic Petri nets for the performance analysis of multiprocessor systems. ACM Transactions on Computer Systems, 2 (1), May 1984.
M. Ajmone Marsan, G. Balbo, G. Chiola, and G. Conte. Generalized stochastic Petri nets revisited: random switches and priorities. In Proc. Int. Workshop on Petri Nets and Performance Models, pages 44–53, IEEE-CS Press, Madison, WI, USA, August 1987.
J. A. Carrasco. Automated construction of compound Markov chains from generalized stochastic high-level Petri nets. In Proc. 3rd Intern. Workshop on Petri Nets and Perfor-mance Models, pages 93–102, IEEE-CS Press, Kyoto, Japan, December 1989.
G. Chiola, G. Bruno, and T. Demaria. Introducing a color formalism into generalized stochastic Petri nets. In Proc. 9th Europ. Workshop on Application and Theory of Petri Nets, Venezia, Italy, June 1988.
G. Chiola and G. Franceschinis. Colored GSPN models and automatic symmetry detection.In Proc. 3rd Intern. Workshop on Petri Nets and Performance Models,IEEE-CS Press, Kyoto, Japan, December 1989.
J.M. Couvreur and J. Martinez. Linear invariants in commutative high-level nets. In Proc.10th International Conference on Application and Theory of Petri Nets, Bonn, Germany, June 1989.
J.M. Couvreur. The general computation of flows for coloured nets. In Proc. 11th Interna-tional Conference on Application and Theory of Petri Nets, Paris, France, June 1990.
C. Dutheillet and S. Haddad. Aggregation and disaggregation of states in colored stochastic Petri nets: application to a multiprocessor architecture. In Proc. 3rd Intern. Workshop on Petri Nets and Performance Models, IEEE-CS Press, Kyoto, Japan, December 1989.
C. Dutheillet and S. Haddad. Regular stochastic Petri nets. In Proc. 10th Intern. Conf.Application and Theory of Petri Nets, Bonn, Germany, June 1989.
H.J. Genrich. Predicate/transition nets. In W. Brawer, W. Reisig, and G. Rozenberg,editors, Advances on Petri Nets ‘86–Part I, pages 207–247, Springer Verlag, Bad Honnef, West Germany, February 1987.
H.J. Genrich. Equivalence transformations of Pr/T nets. In Proc. 9th Europ. Workshop on Application and Theory of Petri Nets, Venezia, Italy, June 1988.
H. J. Genrich and K. Lautenbach. System modelling with high-level Petri nets. Theoretical Computer Science, 13: 109–136, 1981.
S. Haddad. Une Categorie Regulier de Reseau de Petri de Haut Niveau: Definition, Pro-prietes et Reductions. PhD thesis, Lab. MASI, Universite P. et M. Curie (Paris 6), Paris, France, Oct 1987. These de Doctorat, RR87/197 (in French).
S. Haddad. Generalization of reduction theory to coloured nets. In Proc. 9th Europ. Work-shop on Application and Theory of Petri Nets, Venezia, Italy, June 1988.
S. Haddad and J.M. Couvreur. Towards a general and powerful computation of flows for parametrized coloured nets. In Proc. 9th Europ. Workshop on Application and Theory of Petri Nets, Venezia, Italy, June 1988.
P. Huber, A.M. Jensen, L.O. Jepsen, and K. Jensen. Towards reachability trees for high-level Petri nets. In G. Rozenberg, editor, Advances on Petri Nets, pages 215–233, Springer Verlag, 1984.
K. Jensen. Coloured Petri nets and the invariant method. Theoretical Computer Science, 14: 317–336, 1981.
Chuang Lin and C. Marinescu. Stochastic high level Petri nets and applications. IEEE Transactions on Computers, 37 (7): 815–825, July 1988.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S. (1991). On Well-Formed Coloured Nets and Their Symbolic Reachability Graph. In: Jensen, K., Rozenberg, G. (eds) High-level Petri Nets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-84524-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-84524-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54125-7
Online ISBN: 978-3-642-84524-6
eBook Packages: Springer Book Archive