Advertisement

The analysis of distributed systems by means of predicate/transition-nets

  • Hartmann J. Genrich
  • Kurt Lautenbach
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 70)

Abstract

Within the framework of net-semantics of models of dynamic systems, the present paper introduces a new standard interpretation of nets called predicate/transition-nets (Pr/T-nets). These nets are schemes of ‘ordinary’ Petri nets. The places (circles) of Pr/T-nets represent changing properties of, or relations between, individuals; they are ‘predicates’ with variable extension. A current case of a system modelled by a Pr/T-net is denoted by marking the places with those tuples of individual symbols for which the respective predicates hold in that case. The transitions (boxes) are schemes of elementary changes of markings constituting the processes carried by the system. Instances of these schemes are generated by means of consistent substitution of individual variables by symbols.

Assuming some familiarity with Petri nets, the paper first introduces the predicate/transition-net model in its most general form, from which some special cases are derived. Then it is shown that the ‘dead’ transitions of a Pr/T-net represent first-order formulas expressing invariant assertions about the modelled systems. Next the linear-algebraic techniques for finding invariants are transferred to Pr/T-nets. The last part of the paper is devoted to the analysis of a scheme for organizing distributed database systems.

Keywords

Logical Formula Firing Transition Distribute Database System Negative Acknowledgement Integer Polynomial 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [EL77]
    Ellis, C.A.: Consistency and Correctness of Duplicate Database Systems Proc. of the 6th Symposium on Operating System Principles, Purdue University, Nov. 1977. ACM Operating Systems Review Vol.11, Nr. 5 (1977)Google Scholar
  2. [GEL78]
    Genrich, H.J.; Lautenbach, K.: Facts in Place/Transition-Nets Mathematical Foundations of Computer Science 1978 / Winkowski, J. (Ed.) — Berlin, Heidelberg, New York: Springer Verlag (1978)Google Scholar
  3. [GTM76]
    Genrich, H.J.; Thieler-Mevissen, G.: The Calculus of Facts Mathematical Foundations of Computer Science 1976 / Mazurkiewicz, A. (Ed.) — Berlin, Heidelberg, New York: Springer Verlag (1976)Google Scholar
  4. [HE75]
    Herstein, I.N.: Topics in Algebra, 2nd Edition Lexington, Toronto: Xerox College Publishing (1975)Google Scholar
  5. [LA73]
    Lautenbach, K.: Exakte Bedingungen der Lebendigkeit für eine Klasse von Petri-Netzen St.Augustin: Gesellschaft für Mathematik und Datenverarbeitung Bonn, Bericht Nr. 82 (1973)Google Scholar
  6. [LAS74]
    Lautenbach, K.; Schmid, H.A.: Use of Nets for Proving Correctness of Concurrent Process Systems Proceedings of IFIP Congress 74. — North Holland Publ. Comp. (1974)Google Scholar
  7. [MI78]
    Milne, G.J.: Modelling Distributed Database Protocolls by Synchronisation Processes (Draft Version, Nov. 1978) Department of Computer Science, Edinburgh UniversityGoogle Scholar
  8. [PE62]
    Petri, C.A.: Kommunikation mit Automaten Bonn: Institut für Instrumentelle Mathematik, Schriften des IIM Nr. 2 (1962)Google Scholar
  9. [PE67]
    Petri, C.A.: Grundsätzliches zur Beschreibung diskreter Pozesse 3. Colloquium über Automathentheorie. — Basel: Birkhäuser Verlag (1967)Google Scholar
  10. [PE73]
    Petri, C.A.: Concepts of Net Theory Mathematical Foundations of Computer Science-Math. Institute of the Slovak Ac. of Sciences (1973)Google Scholar
  11. [PE75]
    Petri, C.A.: Interpretations of Net Theory St.Augustin: Gesellschaft für Mathematik und Datenverarbeitung, Interner Bericht ISF-75-07 (1975)Google Scholar
  12. [PE77]
    Petri, C.A.: General Net Theory Computing System Design: Proceedings of the Joint IBM University of Newcastle upon Tyne Seminar, Sept. 1976 / Shaw, B. (Ed.). — University of Newcastle upon Tyne (1977)Google Scholar
  13. [SC77]
    Schiffers, M.: Behandlung eines Synchronisationsproblems mit gefärbten Petri-Netzen Universität Bonn, Diplomarbeit (1977)Google Scholar
  14. [SCW78]
    Schiffers, M; Wedde, H.: Analyzing Program Solutions of Coordination Problems by CP-nets Mathematical Foundations of Computer Science 1978 / Winkowski, J. (Ed.) — Berlin, Heidelberg, New York: Springer Verlag (1978)Google Scholar
  15. [SH79]
    Shapiro, R.M.: Towards a Design Methodology for Information Systems Ansätze einer Organisationstheorie rechnergestützter Informationssysteme 1974 — St.Augustin: Gesellschaft für Mathematik und Datenverarbeitung Bonn, Bericht Nr. 111 (1979)Google Scholar
  16. [SHT78]
    Shapiro, R.M.: Thiagarajan, P.S.: On the Maitenance of Distributed Copies of a Database St.Augustin: Gesellschaft für Mathematik und Datenverarbeitung Bonn, Interner Bericht ISF-78-04 (1978)Google Scholar
  17. [TM76]
    Thieler-Mevissen, G.: The Petri Net Calculus of Predicate Logic St.Augustin: Gesellschaft für Mathematik und Datenverarbeitung Bonn, Interner Bericht ISF-76-09 (1976)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Hartmann J. Genrich
    • 1
  • Kurt Lautenbach
    • 1
  1. 1.Gesellschaft für Mathematik und Datenverarbeitung Institut für InformationssystemforschungSchloss BirlinghovenSt. Augustin 1West Germany

Personalised recommendations