This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. Bibliography
G. Birkhoff "Lattice theory" AMS Publ., Providence (3rd ed. 1967).
G.W. Brams "Réseaux de Petri: theorie et pratique" T.1. Edition Masson (1983).
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).
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).
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).
M.G. Gouda and L.E. Rosier "Synchronisable networks of communicating finite state machines" report, the University of Texas at Austin (1985).
M. Hack "Petri net language" Comp. Struct. Group Memo 124, Project MAC, Massachusetts Inst. of Techn. Cambridge, Massachussets (June 1975).
M. Hack "Decidability questions for Petri nets", MIT, LCS, TR 161, Cambridge, MA, (1976).
G. Higman "Ordering by divisibility in abstract algebras" Proc. London Math. Soc. 2 (1952).
R.M. Karp and R.E. Miller "Parallel program schemata" J.C.S.S. (4) pp.147–195 (1969).
T. Kasai and R.E. Miller "Homomorphisms between models of parallel computation" J.C.S.S. 25 pp.285–331 (1982).
R.M. Keller "Vector replacement systems: a formalism for modeling asynchronous systems" Princeton Univ., Tech. Rep. no117 (1972).
R.M. Keller "Formal verification of parallel program" Comm. of the A.C.M. Vol.19 no7 pp.371–384 (May 1976).
S.R. Kosaraju "Decidability of reachability in vector addition systems" dans Proc. 14th Ann. ACM Symp. on Theo. of Comp. (1982).
J.B. Kruskal "The theory of well-quasi-ordering: a frequently rediscovered concept" J.C.T. (A) 13 (1972).
G. Memmi and A. Finkel "An introduction to Fifo nets — monogeneous nets: a subclass of Fifo nets" T.C.S. 35 (1985).
J.L. Peterson "Petri net theory and the modelling of systems" Prentice-Hall, (1981).
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).
R. Valk and M. Jantzen "The residue of vector sets with applications to decidability problems in Petri nets" Acta Informatica 21 (1985).
G.Vidal-Naquet "Rationalité et déterminisme dans les réseaux de Petri" Thèse d'Etat Univ. Paris 6, (April 1981).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Finkel, A. (1987). A generalization of the procedure of karp and miller to well structured transition systems. In: Ottmann, T. (eds) Automata, Languages and Programming. ICALP 1987. Lecture Notes in Computer Science, vol 267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18088-5_43
Download citation
DOI: https://doi.org/10.1007/3-540-18088-5_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18088-3
Online ISBN: 978-3-540-47747-1
eBook Packages: Springer Book Archive