Abstract
Elaboration of reachability analysis in the context of Predicate/Transition nets is studied. For this purpose, parameters are introduced into the markings of Predicate/Transition nets. These parameters represent any fixed individual values potentially appearing in the marking. The formalism for dealing with parameterized markings is developed and the dynamics of Predicate/Transition nets are augmented to cope with parameters. These are used to define parameterized reachability trees and an algorithm for generating them is presented. They are shown to be significantly smaller than ordinary reachability trees and to contain the corresponding information: from one parameterized reachability tree several instances of ordinary reachability trees can be derived.
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
C. Chang, H. Keisler: Model Theory. North Holland, Amsterdam, (1973).
C. Chang, R. Lee: Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, (1973).
G. Chiola et al: On Well-Formed Coloured Nets and their Symbolic Reachability Graph. Proceedings of the Eleventh International Conference on Applications and Theory of Petri nets, Paris, June 1990.
C. Dutheillet, S. Haddad: Regular Stochastic Petri Nets. Proceedings of the Tenth International Conference on Applications and Theory of Petri nets, Bonn, June 1989.
H. Genrich: Projections on C/E-systems. Proceedings of Sixth European Workshop on Applications and Theory of Petri nets, Espoo, Finland, June 1985.
H. Genrich: Predicate/Transition nets. Petri Nets: Central Models and Their Properties (eds. W. Brauer, W. Reisig, G. Rozenberg), Lecture Notes in Computer Science, Vol. 254, Springer-Verlag, Berlin (1987).
K. Jensen: Coloured Petri Nets. Petri Nets: Central Models and Their Properties (eds. W. Brauer, W. Reisig, G. Rozenberg), Lecture Notes in Computer Science, Vol. 254, Springer-Verlag, Berlin (1987).
P. Huber, A. Jensen, L. Jepsen, K. Jensen: Reachability Trees for High Level nets. Theoretical Computer Science, Nr. 45, (1986), pp. 261–292.
R. Kujansuu, M. Lindqvist: Efficient Algorithms for Computing S-invariants for Predicate/Transition Nets. Proceedings of Fifth European Workshop on Applications and Theory of Petri Nets, Aarhus, Denmark, June 1984.
M. Lindqvist: Parameterized Reachability Trees for Predicate/transition Nets. Acta Polytechnica Scandinavica, Mathematics and Computer Science Series No. 54, Helsinki, 1989, 120 pp.
W. Reisig: Petri Nets, An Introduction. Springer-Verlag, Berlin, (1985).
W. Reisig: A Strong Part of Concurrency. Advances in Petri Nets 1987 (ed. G. Rozenberg), Lecture Notes in Computer Science, Vol. 266, Springer-Verlag, Berlin (1987).
A. Valmari: Error Detection by Reduced Reachability Graph Generation. Proceedings of 9th European Workshop on Applications and Theory of Petri Nets, Venice, June 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lindqvist, M. (1993). Parameterized reachability trees for Predicate/Transition nets. In: Rozenberg, G. (eds) Advances in Petri Nets 1993. ICATPN 1991. Lecture Notes in Computer Science, vol 674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56689-9_49
Download citation
DOI: https://doi.org/10.1007/3-540-56689-9_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56689-2
Online ISBN: 978-3-540-47631-3
eBook Packages: Springer Book Archive