Advertisement

On the rationality of petri net languages

  • R. Valk
  • G. Vidal
Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)

Keywords

Finite Automaton Labelling Function Coverability Graph Maximal Node Program Machine 
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. [Bo]
    BOASSON, L. Paires Itérantes et Langages Algébriques, Thèse de Doctorat, Université Paris VII, 1974Google Scholar
  2. [Ha]
    HACK, M. Decidability questions for Petri nets, MIT, Laboratory for Computer Science, Techn. Rep. 161, 1976Google Scholar
  3. [Hö]
    HÖPNER, M. Über den Zusammenhang von Szilardsprachen und Matrixgrammatiken, Bericht Nr. 12 des Inst. für Informatik, Univ. Hamburg Hamburg 1974Google Scholar
  4. [Ko]
    KOPP, H. Bemerkungen über die Struktur paralleler Programmschemata, non published paperGoogle Scholar
  5. [Pe]
    PETERSON, J.L. Computation Sequence Sets, Journal of Comp. and Syst.Sci. 13 (1976), 1–24Google Scholar
  6. [VV]
    VALK,R., VIDAL-NAQUET,G., Sur la Décidabilité de la Rationalité des Langages associés aux Réseaux de Petri Publ. de l'Inst. de Programmation, Univ. Paris VI, Paris 1976Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • R. Valk
  • G. Vidal

There are no affiliations available

Personalised recommendations