A generalization of the procedure of karp and miller to well structured transition systems

  • Alain Finkel
Petri Nets, Algebraic Specification
Part of the Lecture Notes in Computer Science book series (LNCS, volume 267)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. Bibliography

  1. -[Birkhoff 67]
    G. Birkhoff "Lattice theory" AMS Publ., Providence (3rd ed. 1967).Google Scholar
  2. -[Brams 83]
    G.W. Brams "Réseaux de Petri: theorie et pratique" T.1. Edition Masson (1983).Google Scholar
  3. -[Choquet...87]
    A. Choquet and A. Finkel "Simulation of linear Fifo nets by a new class of Petri nets" Rapport LRI no324, Univ. Paris 11, Orsay (January 1987).Google Scholar
  4. -[Dickson 13]
    L.E. Dickson "Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors", Amer. J. Math. 35 pp.413–422 (1913).Google Scholar
  5. -[Finkel 86]
    A. Finkel "Structuration des systèmes de transitions: applications au contrôle du parallélisme par files Fifo" Thèse d'Etat Université d'Orsay (17 June 1986).Google Scholar
  6. -[Gouda...86]
    M.G. Gouda and L.E. Rosier "Synchronisable networks of communicating finite state machines" report, the University of Texas at Austin (1985).Google Scholar
  7. -[Hack 75]
    M. Hack "Petri net language" Comp. Struct. Group Memo 124, Project MAC, Massachusetts Inst. of Techn. Cambridge, Massachussets (June 1975).Google Scholar
  8. -[Hack 76]
    M. Hack "Decidability questions for Petri nets", MIT, LCS, TR 161, Cambridge, MA, (1976).Google Scholar
  9. -[Higman 52]
    G. Higman "Ordering by divisibility in abstract algebras" Proc. London Math. Soc. 2 (1952).Google Scholar
  10. -[Karp...69]
    R.M. Karp and R.E. Miller "Parallel program schemata" J.C.S.S. (4) pp.147–195 (1969).Google Scholar
  11. -[Kasai...82]
    T. Kasai and R.E. Miller "Homomorphisms between models of parallel computation" J.C.S.S. 25 pp.285–331 (1982).Google Scholar
  12. -[Keller 72]
    R.M. Keller "Vector replacement systems: a formalism for modeling asynchronous systems" Princeton Univ., Tech. Rep. no117 (1972).Google Scholar
  13. -[Keller 76]
    R.M. Keller "Formal verification of parallel program" Comm. of the A.C.M. Vol.19 no7 pp.371–384 (May 1976).Google Scholar
  14. -[Kosaraju 82]
    S.R. Kosaraju "Decidability of reachability in vector addition systems" dans Proc. 14th Ann. ACM Symp. on Theo. of Comp. (1982).Google Scholar
  15. -[Kruskal 72]
    J.B. Kruskal "The theory of well-quasi-ordering: a frequently rediscovered concept" J.C.T. (A) 13 (1972).Google Scholar
  16. -[Memmi...85]
    G. Memmi and A. Finkel "An introduction to Fifo nets — monogeneous nets: a subclass of Fifo nets" T.C.S. 35 (1985).Google Scholar
  17. -[Peterson 81]
    J.L. Peterson "Petri net theory and the modelling of systems" Prentice-Hall, (1981).Google Scholar
  18. -[Rosier...85]
    L.E. Rosier and H.C. Yen "Boundedness, empty channel detection, and synchronisation for communicating finite automata" T.C.S. 44 (1) pp 69–106 (1986).CrossRefGoogle Scholar
  19. -[Valk...85]
    R. Valk and M. Jantzen "The residue of vector sets with applications to decidability problems in Petri nets" Acta Informatica 21 (1985).Google Scholar
  20. -[Vidal-Naquet 81]
    G.Vidal-Naquet "Rationalité et déterminisme dans les réseaux de Petri" Thèse d'Etat Univ. Paris 6, (April 1981).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Alain Finkel
    • 1
  1. 1.Laboratoire de Recherche en InformatiqueUniversité Paris-SudOrsay CedexFRANCE

Personalised recommendations