The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Victor Khomenko: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Josep Carmona, Jordi Cortadella, Victor Khomenko, Alexandre Yakovlev
    Synthesis of Asynchronous Hardware from Petri Nets. [Citation Graph (0, 0)][DBLP]
    Lectures on Concurrency and Petri Nets, 2003, pp:345-401 [Conf]
  2. Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
    Logic Synthesis for Asynchronous Circuits Based on Petri Net Unfoldings and Incremental SAT. [Citation Graph (0, 0)][DBLP]
    ACSD, 2004, pp:16-25 [Conf]
  3. Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
    Detecting State Coding Conflicts in STG Unfoldings Using SAT. [Citation Graph (0, 0)][DBLP]
    ACSD, 2003, pp:51-60 [Conf]
  4. Victor Khomenko, Agnes Madalinski, Alexandre Yakovlev
    Resolution of Encoding Conflicts by Signal Insertion and Concurrency Reduction Based on STG Unfoldings. [Citation Graph (0, 0)][DBLP]
    ACSD, 2006, pp:57-68 [Conf]
  5. Mark Schäfer, Walter Vogler, Ralf Wollowski, Victor Khomenko
    Strategies for Optimised STG Decomposition. [Citation Graph (0, 0)][DBLP]
    ACSD, 2006, pp:123-132 [Conf]
  6. Victor Khomenko, Maciej Koutny, Walter Vogler
    Canonical Prefixes of Petri Net Unfoldings. [Citation Graph (0, 0)][DBLP]
    CAV, 2002, pp:582-595 [Conf]
  7. Claus Schröter, Victor Khomenko
    Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings. [Citation Graph (0, 0)][DBLP]
    CAV, 2004, pp:109-121 [Conf]
  8. Victor Khomenko, Maciej Koutny
    LP Deadlock Checking Using Partial Order Dependencies. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2000, pp:410-425 [Conf]
  9. Victor Khomenko, Maciej Koutny
    Towards an Efficient Algorithm for Unfolding Petri Nets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2001, pp:366-380 [Conf]
  10. Victor Khomenko, Alex Kondratyev, Maciej Koutny, Walter Vogler
    Merged Processes - A New Condensed Representation of Petri Net Behaviour. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:338-352 [Conf]
  11. Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
    Detecting State Coding Conflicts in STGs Using Integer Programming. [Citation Graph (0, 0)][DBLP]
    DATE, 2002, pp:338-345 [Conf]
  12. Agnes Madalinski, Alexandre V. Bystrov, Victor Khomenko, Alexandre Yakovlev
    Visualization and Resolution of Coding Conflicts in Asynchronous Circuit Design. [Citation Graph (0, 0)][DBLP]
    DATE, 2003, pp:10926-10931 [Conf]
  13. Keijo Heljanko, Victor Khomenko, Maciej Koutny
    Parallelisation of the Petri Net Unfolding Algorithm. [Citation Graph (0, 0)][DBLP]
    TACAS, 2002, pp:371-385 [Conf]
  14. Victor Khomenko, Maciej Koutny
    Branching Processes of High-Level Petri Nets. [Citation Graph (0, 0)][DBLP]
    TACAS, 2003, pp:458-472 [Conf]
  15. Alexei Iliasov, Victor Khomenko, Maciej Koutny, Alexander Romanovsky
    On Specification and Verification of Location-Based Fault Tolerant Mobile Systems. [Citation Graph (0, 0)][DBLP]
    RODIN Book, 2006, pp:168-188 [Conf]
  16. Victor Khomenko, Alex Kondratyev, Maciej Koutny, Walter Vogler
    Merged processes: a new condensed representation of Petri net behaviour. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2006, v:43, n:5, pp:307-330 [Journal]
  17. Victor Khomenko, Maciej Koutny, Walter Vogler
    Canonical prefixes of Petri net unfoldings. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2003, v:40, n:2, pp:95-118 [Journal]
  18. Alexander A. Letichevsky, Julia V. Kapitonova, Vladislav A. Volkov, A. Chugayenko, Victor Khomenko, David R. Gilbert
    The development of interactive algorithms for the Mathematical Environment. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:23, n:3, pp:- [Journal]
  19. Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
    Detecting State Encoding Conflicts in STG Unfoldings Using SAT. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:62, n:2, pp:221-241 [Journal]
  20. Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
    Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:70, n:1-2, pp:49-73 [Journal]
  21. Victor Khomenko, Mark Schäfer, Walter Vogler
    Output-Determinacy and Asynchronous Circuit Synthesis. [Citation Graph (0, 0)][DBLP]
    ACSD, 2007, pp:147-156 [Conf]
  22. Victor Khomenko
    Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings. [Citation Graph (0, 0)][DBLP]
    ACSD, 2007, pp:137-146 [Conf]
  23. Victor Khomenko
    Behaviour-Preserving Transition Insertions in Unfolding Prefixes. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2007, pp:204-222 [Conf]
  24. Victor Khomenko, Mark Schäfer
    Combining Decomposition and Unfolding for STG Synthesis. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2007, pp:223-243 [Conf]
  25. Victor Khomenko, Maciej Koutny
    Verification of bounded Petri nets using integer programming. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2007, v:30, n:2, pp:143-176 [Journal]
  26. Thomas Chatain, Victor Khomenko
    On the well-foundedness of adequate orders used for construction of complete unfolding prefixes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:4, pp:129-136 [Journal]

  27. Flat Arbiters. [Citation Graph (, )][DBLP]


  28. Checking pi-Calculus Structural Congruence is Graph Isomorphism Complete. [Citation Graph (, )][DBLP]


  29. A Practical Approach to Verification of Mobile Systems Using Net Unfoldings. [Citation Graph (, )][DBLP]


  30. Workcraft - A Framework for Interpreted Graph Models. [Citation Graph (, )][DBLP]


  31. A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes. [Citation Graph (, )][DBLP]


  32. STG decomposition strategies in combination with unfolding. [Citation Graph (, )][DBLP]


  33. A Case for Using Signal Transition Graphs for Analysing and Refining Genetic Networks. [Citation Graph (, )][DBLP]


Search in 0.012secs, Finished in 0.014secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002