Abstract
Well-formed Nets (WN) structural analysis techniques allow to study interesting system properties without requiring the state space generation. In order to avoid the net unfolding, which would reduce significantly the effectiveness of the analysis, a symbolic calculus allowing to directly work on the WN colour structure is needed. The algorithms for high level Petri nets structural analysis most often require a common subset of operators on symbols annotating the net elements, in particular the arc functions. These operators are the function difference, the function transpose and the function composition. This paper focuses on the first two, it introduces a language to denote structural relations in WN and proves that it is actually closed under the difference and transpose.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Jensen, K., Rozenberg, G. (eds.): High-Level Petri Nets. Theory and Application. Springer, Heidelberg (1991)
Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: Stochastic well-formed coloured nets for symmetric modelling applications. IEEE TC 42(11), 1343–1360 (1993)
Jensen, K.: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Basic Concepts. Monographs in Theoretical Computer Science, vol. 1. Springer, Heidelberg (1997) (2nd corrected printing 1997. ISBN: 3-540-60943-1)
Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: A Symbolic Reachability Graph for Coloured Petri Nets. Theoretical Computer Science B (Logic, semantics and theory of programming) 176, 39–65 (1997)
Brgan, R., Poitrenaud, D.: An efficient algorithm for the computation of stubborn sets of well formed Petri nets. In: DeMichelis, G., Díaz, M. (eds.) ICATPN 1995. LNCS, vol. 935, pp. 121–140. Springer, Heidelberg (1995)
Teruel, E., Franceschinis, G., De Pierro, M.: Well-defined generalized stochastic Petri nets: A net-level method to specify priorities. IEEE TSE 29(11), 962–973 (2003)
Barkaoui, K., Dutheillet, C., Haddad, S.: An efficient algorithm for finding structural deadlocks in colored Petri nets. In: Ajmone Marsan, M. (ed.) ICATPN 1993. LNCS, vol. 691, pp. 69–88. Springer, Heidelberg (1993)
Gaeta, R.: Efficient discrete-event simulation of colored petri nets. IEEE TSE 22(9), 629–639 (1996)
Dutheillet, C., Haddad, S.: Structural analysis of coloured nets. application to the detection of confusion. Technical report in MASI 92.16 (1992)
Dutheillet, C., Haddad, S.: Conflict sets in colored Petri nets. In: Proc. of Petri Nets and Performance Models, pp. 76–85 (1993)
De Pierro, M.: Ph.D. thesis: Structural analysis of conflicts and causality in GSPN and SWN. Università di Torino, Italia (2004), http://www.di.unito.it/~depierro/public/
Capra, L., De Pierro, M., Franceschinis, G.: Symbolic calculus for structural relations in well-formed nets. Technical report RT 03-04; Dipartimento di Informatica e Comunicazione, Università di Milano, Italia (2004), http://www.di.unito.it/~depierro/public/
Capra, L., De Pierro, M., Franceschinis, G.: An application example of symbolic calculus for SWN structural relations. In: Proceedings of the 7th International Workshop on Discrete Event Systems, 2004, Reims, France. Elsevier-Oxford, Amsterdam (2005)
Valmari, A.: Stubborn sets of coloured Petri nets. In: Proceedings of the 12th International Conference on Application and Theory of Petri Nets, 1991, Gjern, Denmark, pp. 102–121 (1991); NewsletterInfo: 39
Valmari, A.: State of the art report: Stubborn sets. Petri Net Newsletter, 6–14 (1994)
Kristensen, L.M., Valmari, A.: sloopy Finding stubborn sets of coloured Petri nets without unfolding. In: Desel, J., Silva, M. (eds.) ICATPN 1998. LNCS, vol. 1420, pp. 104–123. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Capra, L., De Pierro, M., Franceschinis, G. (2005). A High Level Language for Structural Relations in Well-Formed Nets. In: Ciardo, G., Darondeau, P. (eds) Applications and Theory of Petri Nets 2005. ICATPN 2005. Lecture Notes in Computer Science, vol 3536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494744_11
Download citation
DOI: https://doi.org/10.1007/11494744_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26301-2
Online ISBN: 978-3-540-31559-9
eBook Packages: Computer ScienceComputer Science (R0)