The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kurt Lautenbach: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hartmann J. Genrich, Kurt Lautenbach
    System Modelling with High-Level Petri Nets. [Citation Graph (7, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:13, n:, pp:109-136 [Journal]
  2. Hartmann J. Genrich, Kurt Lautenbach, P. S. Thiagarajan
    Elements of General Net Theory. [Citation Graph (2, 0)][DBLP]
    Advanced Course: Net Theory and Applications, 1975, pp:21-163 [Conf]
  3. Hartmann J. Genrich, Kurt Lautenbach
    Facts in Place/Transition-Nets. [Citation Graph (2, 0)][DBLP]
    MFCS, 1978, pp:213-231 [Conf]
  4. Kurt Lautenbach
    Linear Algebraic Techniques for Place/Transition Nets. [Citation Graph (0, 0)][DBLP]
    Advances in Petri Nets, 1986, pp:142-167 [Conf]
  5. G. Comparin, Gaetano Aurelio Lanzarone, Kurt Lautenbach, Anastasia Pagnoni, W. Panzeri, A. Torgano
    Guidelines on using net analysis techniques with large specifications. [Citation Graph (0, 0)][DBLP]
    Applications and Theory in Petri Nets, 1985, pp:142-161 [Conf]
  6. Hartmann J. Genrich, Kurt Lautenbach
    S-Invariance in Predicate/Transition Nets. [Citation Graph (0, 0)][DBLP]
    European Workshop on Applications and Theory of Petri Nets, 1982, pp:98-111 [Conf]
  7. Kurt Lautenbach
    Reproducibility of the Empty Marking. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2002, pp:237-253 [Conf]
  8. Kurt Lautenbach
    Logical Reasoning and Petri Nets. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2003, pp:276-295 [Conf]
  9. Kurt Lautenbach, Anastasia Pagnoni
    Liveness and duality in marked-graph-like predicate/transition nets. [Citation Graph (0, 0)][DBLP]
    European Workshop on Applications and Theory in Petri Nets, 1984, pp:331-352 [Conf]
  10. Kurt Lautenbach, Hanno Ridder
    Liveness in Bounded Petri Nets Which Are Covered by T-Invariants. [Citation Graph (0, 0)][DBLP]
    Application and Theory of Petri Nets, 1994, pp:358-375 [Conf]
  11. Werner E. Kluge, Kurt Lautenbach
    Kombinatorische Beschreibung und Lösung von Organisationsproblemen. [Citation Graph (0, 0)][DBLP]
    ARCS, 1980, pp:178-193 [Conf]
  12. Rudolf J. Kruse, Kurt Lautenbach
    Constraint Satisfaction mit Petri-Netzen. [Citation Graph (0, 0)][DBLP]
    AWPN, 1999, pp:- [Conf]
  13. Kurt Lautenbach, Jörg Müller, Stephan Philippi
    Modellierung, Simulation und Analyse mit dem Petri-Netz-Tool POSEIDON. [Citation Graph (0, 0)][DBLP]
    Promise, 2002, pp:163-174 [Conf]
  14. Michael Dahr, Kurt Lautenbach
    Petri-Netz-Darstellung von Deduktiven Datenbanken. [Citation Graph (0, 0)][DBLP]
    Grundlagen von Datenbanken, 1991, pp:16-22 [Conf]
  15. Kurt Lautenbach, Hans Albrecht Schmid
    Use of Petri Nets for Proving Correctness of Concurrent Process Systems. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1974, pp:187-191 [Conf]
  16. Hartmann J. Genrich, Kurt Lautenbach, P. S. Thiagarajan
    Substitution Systems - A Family of System Models Based on Concurrency. [Citation Graph (0, 0)][DBLP]
    MFCS, 1980, pp:698-723 [Conf]
  17. Kurt Lautenbach, Horst Wedde
    Generating Control Mechanisms by Restrictions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1976, pp:416-422 [Conf]
  18. Hartmann J. Genrich, Kurt Lautenbach
    The Analysis of Distributed Systems by Means of Predicate ? Transition-Nets. [Citation Graph (0, 0)][DBLP]
    Semantics of Concurrent Computation, 1979, pp:123-147 [Conf]
  19. Hartmann J. Genrich, Kurt Lautenbach
    Synchronisationsgraphen [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1973, v:2, n:, pp:143-161 [Journal]
  20. Kurt Lautenbach, Anastasia Pagnoni
    On the various high-level Petri Nets and their invariatnts. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1984, v:23, n:, pp:42-58 [Journal]
  21. Ralf Hofestädt, Kurt Lautenbach, Markus Löffler
    Workshop Modellierung der Zelldifferenzierung. [Citation Graph (0, 0)][DBLP]
    KI, 1994, v:8, n:1, pp:39- [Journal]
  22. Werner E. Kluge, Kurt Lautenbach
    The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1982, v:31, n:3, pp:194-207 [Journal]

Search in 0.035secs, Finished in 0.036secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002