Advertisement

Reachability homomorphisms on nets

  • Jürgen Ebert
  • Jürgen Perl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 100)

Abstract

Since Petri-net-descriptions of processes tend to be impracticably large, there is a need for a condensation mechanism. This paper attacks this problem by at first describing a purely structural condensation operation as a tool for stepwise condensation and refinement. Then, a consistent semantic interpretation is given, which allows to transform marking properties dynamically.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. [EBERT 80a]
    Jürgen Ebert An analogy between nets and hypergraphs Newsletter No. 4, Feb. 1980, Gesellschaft für Informatik, SIG "Petri Nets and Related System Models", 7–10Google Scholar
  2. [EBERT 80b]
    Jürgen Ebert Erreichbarkeits-konsistente Vergröberungen von Netzen Osnabrücker Schriften zur Mathematik, Reihe M, 1980Google Scholar
  3. [PERL 79]
    Jürgen Perl Reachability-homomorphisms on graphs in U. Pape, "Discrete Structures and Algorithms", Hanser Verlag, München-Wien, 1980, 101–112Google Scholar
  4. [PERL 80]
    Jürgen Perl übertragung des Markierungsbegriffs auf vergröberte Petrinetze Osnabrücker Schriften zur Mathematik, Reihe M, 1980Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Jürgen Ebert
    • 1
  • Jürgen Perl
    • 1
  1. 1.Universität OsnabrückOsnabrück

Personalised recommendations