Advertisement

Parameterized reachability trees for Predicate/Transition nets

  • Markus Lindqvist
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 674)

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.

Keywords

Petri nets high level nets Predicate/Transition nets reachability analysis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    C. Chang, H. Keisler: Model Theory. North Holland, Amsterdam, (1973).Google Scholar
  2. [2]
    C. Chang, R. Lee: Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, (1973).Google Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    C. Dutheillet, S. Haddad: Regular Stochastic Petri Nets. Proceedings of the Tenth International Conference on Applications and Theory of Petri nets, Bonn, June 1989.Google Scholar
  5. [5]
    H. Genrich: Projections on C/E-systems. Proceedings of Sixth European Workshop on Applications and Theory of Petri nets, Espoo, Finland, June 1985.Google Scholar
  6. [6]
    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).Google Scholar
  7. [7]
    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).Google Scholar
  8. [8]
    P. Huber, A. Jensen, L. Jepsen, K. Jensen: Reachability Trees for High Level nets. Theoretical Computer Science, Nr. 45, (1986), pp. 261–292.Google Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    M. Lindqvist: Parameterized Reachability Trees for Predicate/transition Nets. Acta Polytechnica Scandinavica, Mathematics and Computer Science Series No. 54, Helsinki, 1989, 120 pp.Google Scholar
  11. [11]
    W. Reisig: Petri Nets, An Introduction. Springer-Verlag, Berlin, (1985).Google Scholar
  12. [12]
    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).Google Scholar
  13. [13]
    A. Valmari: Error Detection by Reduced Reachability Graph Generation. Proceedings of 9th European Workshop on Applications and Theory of Petri Nets, Venice, June 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Markus Lindqvist
    • 1
  1. 1.Nokia TelecommunicationsEspooFinland

Personalised recommendations