Advertisement

Infinitary languages of Petri nets and logical sentences

  • Elisabeth Pelz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 266)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [B]
    J.R. Büchi, Weak second-order arithmetic and finite automata, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 6 (1960)Google Scholar
  2. [H]
    R. Hossley, Finite tree automata and ω-automata, MIT, MAC-technical report 102, Cambridge, MA (1976)Google Scholar
  3. [P-P1]
    M. Parigot, E. Pelz, A logical approach of Petri net languages, TCS 39 (1985)Google Scholar
  4. [P-P2]
    M. Parigot, E. Pelz, A logical formalism for the study of the finite behaviour of Petri nets, Advances in Petri nets 1985, LNCS 222, ed. by G. Rozenberg, Springer-Verlag (1986)Google Scholar
  5. [T]
    W. Thomas, A combinatorial Approach to the Theory of w-Automata, Information and Control 48 (1981)Google Scholar
  6. [V]
    R. Valk, Infinite behaviour of Petri nets, TCS 25 (1983)Google Scholar
  7. [V-C]
    R. Valk, H. Carstensen, Infinite behaviour and fairness in Petri nets, Advances in Petri nets 1984, LNCS 188, ed. by G. Rozenberg, Springer-Verlag (1985)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Elisabeth Pelz
    • 1
  1. 1.LRI, CNRS U.A. 410Université Paris-SudOrsay CedexFrance

Personalised recommendations