Detection of Deadlocks in an Infinite Family of Nets
暂无分享,去创建一个
Antoine Petit | Annie Choquet-Geniet | Joffroy Beauquier | Guy Vidal-Naquet | J. Beauquier | Annie Choquet-Geniet | G. Vidal-Naquet | A. Petit
[1] Jean Berstel,et al. Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.
[2] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .
[3] H. T. Kung,et al. Supporting systolic and memory communication in iWarp , 1990, ISCA '90.
[4] Teuvo Kohonen,et al. An introduction to neural computing , 1988, Neural Networks.
[5] A. M. van Tilborg. Panel on future directions in parallel computer architecture , 1989 .
[6] Jean-François Romeuf. A Polynomial Algorithm for Solving Systems of Two Linear Diophantine Equations , 1990, Theor. Comput. Sci..
[7] W. Daniel Hillis,et al. The connection machine , 1985 .
[8] Jean-Luc Lambert. Le problème de l'accessibilité dans les réseaux de Pétri , 1987 .
[9] Joffroy Beauquier,et al. Syntactical Properties of Unbounded Nets of Processors , 1989, TAPSOFT, Vol.1.
[10] Patrice Quinton. An Introduction to Systolic Architectures , 1986, Future Parallel Computers.
[11] Rohit Parikh,et al. On Context-Free Languages , 1966, JACM.