Publications : Igor KHMELNITSKY
-
[KNR+20]
-
I. Khmelnitsky, D. Neider, R. Roy, B. Barbot, B. Bollig,
A. Finkel, S. Haddad, M. Leucker, and L. Ye.
Property-Directed Verification of Recurrent Neural Networks.
Research Report 2009.10610, Computing Research Repository, September
2020.
[ BibTex |
Web page |
PDF ]
-
[HK20]
-
S. Haddad and I. Khmelnitsky.
Dynamic Recursive Petri Nets.
In Proceedings of the 41st International Conference on
Applications and Theory of Petri Nets (PETRI NETS'20), volume 12152
of Lecture Notes in Computer Science, pages 345--366, Paris, France, June
2020. Springer.
doi:
10.1007/978-3-030-51831-8_17.
[ BibTex |
DOI |
Web page ]
-
[FHK20b]
-
A. Finkel, S. Haddad, and I. Khmelnitsky.
Minimal coverability tree construction made complete and
efficient.
In Proceedings of the 23rd International Conference on
Foundations of Software Science and Computation Structures
(FoSSaCS'20), Lecture Notes in Computer Science, pages 237--256, Dublin,
Ireland, April 2020. Springer.
doi:
10.1007/978-3-030-45231-5_13.
[ BibTex |
DOI ]
-
[FHK20a]
-
A. Finkel, S. Haddad, and I. Khmelnitsky.
Commodification of accelerations for the Karp and Miller
Construction.
Discrete Event Dynamic Systems: Theory and Applications, 2020.
doi:
10.1007/s10626-020-00331-z.
[ BibTex |
DOI |
Web page ]
-
[FHK19b]
-
A. Finkel, S. Haddad, and I. Khmelnitsky.
Réification des accélérations pour la construction
de Karp et Miller.
In Actes du 12ème Colloque sur la Modélisation des
Systèmes Réactifs (MSR'19), Angers, France, November 2019. HAL.
[ BibTex |
Web page |
PDF ]
-
[FHK19a]
-
A. Finkel, S. Haddad, and I. Khmelnitsky.
Coverability and Termination in Recursive Petri Nets.
In Proceedings of the 40th International Conference on
Applications and Theory of Petri Nets (PETRI NETS'19), volume 11522
of Lecture Notes in Computer Science, pages 429--448, Aachen, Germany, June
2019. Springer.
doi:
10.1007/978-3-030-21571-2_23.
[ BibTex |
DOI |
Web page |
PDF ]
This file was generated by
bibtex2html 1.98.