Properties of Conflict-Free and Persistent Petri Nets
- 期刊名称Journal of the ACM
- 作者Landweber, L. H.; Robertson, E. L.
- 卷第25卷
- 期第3期
- 印刷ISSN0004-5411
- 文件大小851.29KB
- 发表时间1978-7-1
- DOI10.1145/322077.322079
- 页码352-364
Termination conventions and comparative semanticsEric C. R. Hehner; Andrew J. Malton · 1988
Predicative methodologyEric C. R. Hehner; Lorene E. Gupta; Andrew J. Malton · 1986
From boolean algebra to unified algebraEric C. R. Hehner · 2004
A probability perspectiveEric C. R. Hehner · 2011
Formalization of Time and SpaceEric C. R. Hehner · 1998
A Practical Theory of Programming ||Hehner, Eric C. R. · 1993
Predicative programming Part IIHehner, Eric C. R. · Communications of the ACM · 1984
Predicative programming Part IHehner, Eric C. R. · Communications of the ACM · 1984
Abstraction in query processingImielinski, Tomasz · Journal of the ACM · 1991
The PCP theorem by gap amplificationDinur, Irit · Journal of the ACM · 2007
New Methods in Automatic ExtractingEdmundson, H. P. · Journal of the ACM · 1969
Inference of Reversible LanguagesAngluin, Dana · Journal of the ACM · 1982
Eigenvalues and expansion of regular graphsKahale, Nabil · Journal of the ACM · 1995
An Algorithm for Convex PolytopesChand, Donald R.; Kapur, Sham S. · Journal of the ACM · 1970
How to construct random functionsGoldreich, Oded; Goldwasser, Shafi; Micali, Silvio · Journal of the ACM · 1986
An Algorithm for Subgraph IsomorphismUllmann, J. R. · Journal of the ACM · 1976