default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVictor Khomenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c51]Alex Chan
, Danil Sokolov, Victor Khomenko, Alex Yakovlev:
Bridging the Design Methodologies of Burst-Mode Specifications and Signal Transition Graphs. ASPDAC 2024: 734-739- 2023
- [j22]Alex Chan, Danil Sokolov, Victor Khomenko, David Lloyd, Alex Yakovlev:
Burst Automaton: Framework for Speed-Independent Synthesis Using Burst-Mode Specifications. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42(5): 1560-1573 (2023) - 2022
- [c50]Victor Khomenko, Maciej Koutny, Alex Yakovlev:
Avoiding Exponential Explosion in Petri Net Models of Control Flows. Petri Nets 2022: 261-277 - [c49]Victor Khomenko, Maciej Koutny, Alex Yakovlev:
Slimming down Petri Boxes: Compact Petri Net Models of Control Flows. CONCUR 2022: 8:1-8:16 - [c48]Alex Chan, Danil Sokolov, Victor Khomenko, Alex Yakovlev:
Formal Modelling of Burst-Mode Specifications in a Distributed Environment. FDL 2022: 1-8 - 2021
- [c47]Alex Chan, Danil Sokolov, Victor Khomenko, David Lloyd, Alex Yakovlev:
Synthesis of SI Circuits from Burst-Mode Specifications. DATE 2021: 366-369 - 2020
- [j21]Danil Sokolov, Victor Khomenko, Andrey Mokhov, Vladimir Dubikhin, David Lloyd, Alex Yakovlev:
Automating the Design of Asynchronous Logic Control for AMS Electronics. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(5): 952-965 (2020) - [c46]Victor Khomenko, Danil Sokolov, Alex Yakovlev, David Lloyd:
Handshake Verification in WORKCRAFT. ASYNC 2020: 63-64
2010 – 2019
- 2019
- [j20]Victor Khomenko, Jetty Kleijn, Wojciech Penczek, Olivier H. Roux:
Preface. Fundam. Informaticae 169(1-2): v-vi (2019) - 2018
- [c45]Danil Sokolov, Victor Khomenko, Alex Yakovlev, David Lloyd:
Design and Verification of Speed-Independent Circuits with Arbitration in Workcraft. ASYNC 2018: 30-31 - [e2]Victor Khomenko, Olivier H. Roux:
Application and Theory of Petri Nets and Concurrency - 39th International Conference, PETRI NETS 2018, Bratislava, Slovakia, June 24-29, 2018, Proceedings. Lecture Notes in Computer Science 10877, Springer 2018, ISBN 978-3-319-91267-7 [contents] - 2017
- [c44]Victor Khomenko, Andrey Mokhov, Danil Sokolov, Alex Yakovlev:
Formal Design and Verification of an Asynchronous SRAM Controller. ACSD 2017: 59-67 - [c43]Victor Khomenko, Danil Sokolov, Andrey Mokhov, Alex Yakovlev:
WAITX: An Arbiter for Non-persistent Signals. ASYNC 2017: 33-40 - [c42]Danil Sokolov, Vladimir Dubikhin, Victor Khomenko, David Lloyd, Andrey Mokhov, Alex Yakovlev:
Benefits of asynchronous control for analog electronics: Multiphase buck case study. DATE 2017: 1751-1756 - [c41]Andrey Mokhov, Danil Sokolov, Victor Khomenko, Alex Yakovlev:
Asynchronous Arbitration Primitives for New Generation of Circuits and Systems. NGCAS 2017: 81-84 - 2016
- [c40]Austin Ogweno, Patrick Degenaar, Victor Khomenko, Alex Yakovlev:
A fixed window Level Crossing ADC with activity dependent power dissipation. NEWCAS 2016: 1-4 - [p1]Richard Banks, Victor Khomenko, L. Jason Steggles:
Modeling Genetic Regulatory Networks. Modeling in Systems Biology, The Petri Net Approach 2016: 73-100 - 2015
- [j19]Loïg Jezequel, Eric Fabre, Victor Khomenko:
Factored Planning: From Automata to Petri Nets. ACM Trans. Embed. Comput. Syst. 14(2): 26:1-26:25 (2015) - [j18]Vasileios Germanos, Stefan Haar, Victor Khomenko, Stefan Schwoon:
Diagnosability under Weak Fairness. ACM Trans. Embed. Comput. Syst. 14(4): 69:1-69:19 (2015) - [j17]Victor Khomenko, Vasileios Germanos:
Modelling and Analysis Mobile Systems Using \pi -calculus (EFCP). Trans. Petri Nets Other Model. Concurr. 10: 153-175 (2015) - [c39]Danil Sokolov, Victor Khomenko, Andrey Mokhov, Alex Yakovlev, David Lloyd:
Design and Verification of Speed-Independent Multiphase Buck Controller. ASYNC 2015: 29-36 - [c38]Andrey Mokhov, Victor Khomenko, Danil Sokolov, Alex Yakovlev:
Opportunistic Merge Element. ASYNC 2015: 116-123 - 2014
- [j16]Victor Khomenko, Andrey Mokhov:
Direct Construction of Complete Merged Processes. Comput. J. 57(5): 693-707 (2014) - [j15]Blai Bonet, Patrik Haslum, Victor Khomenko, Sylvie Thiébaux, Walter Vogler:
Recent advances in unfolding technique. Theor. Comput. Sci. 551: 84-101 (2014) - [j14]Andrey Mokhov, Victor Khomenko:
Algebra of Parameterised Graphs. ACM Trans. Embed. Comput. Syst. 13(4s): 143:1-143:22 (2014) - [c37]Vasileios Germanos, Stefan Haar, Victor Khomenko, Stefan Schwoon:
Diagnosability under Weak Fairness. ACSD 2014: 132-141 - 2013
- [j13]Victor Khomenko, Roland Meyer, Reiner Hüchting:
A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets. Log. Methods Comput. Sci. 9(3) (2013) - [c36]Loïg Jezequel, Eric Fabre, Victor Khomenko:
Factored Planning: From Automata to Petri Nets. ACSD 2013: 130-139 - [c35]César Rodríguez, Stefan Schwoon, Victor Khomenko:
Contextual Merged Processes. Petri Nets 2013: 29-48 - 2012
- [c34]Andrey Mokhov, Victor Khomenko, Arseniy Alekseyev, Alex Yakovlev:
Algebra of Parameterised Graphs. ACSD 2012: 22-31 - [c33]Andrey Mokhov, Victor Khomenko, Danil Sokolov, Alex Yakovlev:
On Dual-Rail Control Logic for Enhanced Circuit Robustness. ACSD 2012: 112-121 - [c32]Roland Meyer, Victor Khomenko, Reiner Hüchting:
A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets. CONCUR 2012: 440-455 - 2011
- [j12]Andrey Mokhov, Victor Khomenko, Alexandre Yakovlev:
Flat Arbiters. Fundam. Informaticae 108(1-2): 63-90 (2011) - [c31]Arseniy Alekseyev, Victor Khomenko, Andrey Mokhov, Dominic Wist, Alex Yakovlev:
Improved Parallel Composition of Labelled Petri Nets. ACSD 2011: 131-140 - [c30]Victor Khomenko:
Unfolding Models of Asynchronous Systems: Applications to Analysis and Synthesis. PNSE 2011: 9 - [c29]Victor Khomenko, Andrey Mokhov:
An Algorithm for Direct Construction of Complete Merged Processes. Petri Nets 2011: 89-108 - [c28]Victor Khomenko:
Logic Decomposition of Asynchronous Circuits Using STG Unfoldings. ASYNC 2011: 3-12 - 2010
- [c27]Victor Khomenko:
A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes. ICGT 2010: 75-90 - [e1]Luís Gomes, Victor Khomenko, João M. Fernandes:
10th International Conference on Application of Concurrency to System Design, ACSD 2010, Braga, Portugal, 21-25 June 2010. IEEE Computer Society 2010, ISBN 978-0-7695-4066-5 [contents]
2000 – 2009
- 2009
- [j11]Victor Khomenko, Mark Schäfer, Walter Vogler, Ralf Wollowski:
STG decomposition strategies in combination with unfolding. Acta Informatica 46(6): 433-474 (2009) - [j10]Roland Meyer, Victor Khomenko, Tim Strazny:
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings. Fundam. Informaticae 94(3-4): 439-471 (2009) - [j9]Victor Khomenko:
Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings. IEEE Trans. Very Large Scale Integr. Syst. 17(7): 855-868 (2009) - [c26]Victor Khomenko, Roland Meyer:
Checking pi-Calculus Structural Congruence is Graph Isomorphism Complete. ACSD 2009: 70-79 - [c25]Andrey Mokhov, Victor Khomenko, Alexandre Yakovlev:
Flat Arbiters. ACSD 2009: 99-108 - [c24]Ivan Poliakov, Victor Khomenko, Alexandre Yakovlev:
Workcraft - A Framework for Interpreted Graph Models. Petri Nets 2009: 333-342 - 2008
- [j8]Victor Khomenko, Agnes Madalinski, Alexandre Yakovlev:
Resolution of Encoding Conflicts by Signal Insertion and Concurrency Reduction Based on STG Unfoldings. Fundam. Informaticae 86(3): 299-323 (2008) - [j7]Victor Khomenko, Mark Schäfer, Walter Vogler:
Output-Determinacy and Asynchronous Circuit Synthesis. Fundam. Informaticae 88(4): 541-579 (2008) - [c23]Roland Meyer, Victor Khomenko, Tim Strazny:
A Practical Approach to Verification of Mobile Systems Using Net Unfoldings. Petri Nets 2008: 327-347 - [c22]Victor Khomenko:
Derivation of Monotonic Covers for Standard-C Implementation Using STG Unfoldings. ASYNC 2008: 141-150 - [c21]Richard Banks, Victor Khomenko, L. Jason Steggles:
A Case for Using Signal Transition Graphs for Analysing and Refining Genetic Networks. MeCBIC 2008: 3-19 - 2007
- [j6]Victor Khomenko, Maciej Koutny:
Verification of bounded Petri nets using integer programming. Formal Methods Syst. Des. 30(2): 143-176 (2007) - [j5]Thomas Chatain, Victor Khomenko:
On the well-foundedness of adequate orders used for construction of complete unfolding prefixes. Inf. Process. Lett. 104(4): 129-136 (2007) - [c20]Victor Khomenko:
Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings. ACSD 2007: 137-146 - [c19]Victor Khomenko, Mark Schäfer, Walter Vogler:
Output-Determinacy and Asynchronous Circuit Synthesis. ACSD 2007: 147-156 - [c18]Victor Khomenko:
Behaviour-Preserving Transition Insertions in Unfolding Prefixes. ICATPN 2007: 204-222 - [c17]Victor Khomenko, Mark Schäfer:
Combining Decomposition and Unfolding for STG Synthesis. ICATPN 2007: 223-243 - 2006
- [j4]Victor Khomenko, Alex Kondratyev, Maciej Koutny, Walter Vogler:
Merged processes: a new condensed representation of Petri net behaviour. Acta Informatica 43(5): 307-330 (2006) - [j3]Victor Khomenko, Maciej Koutny, Alexandre Yakovlev:
Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT. Fundam. Informaticae 70(1-2): 49-73 (2006) - [c16]Victor Khomenko, Agnes Madalinski, Alexandre Yakovlev:
Resolution of Encoding Conflicts by Signal Insertion and Concurrency Reduction Based on STG Unfoldings. ACSD 2006: 57-68 - [c15]Mark Schäfer, Walter Vogler, Ralf Wollowski, Victor Khomenko:
Strategies for Optimised STG Decomposition. ACSD 2006: 123-132 - [c14]Alexei Iliasov, Victor Khomenko, Maciej Koutny, Alexander B. Romanovsky:
On Specification and Verification of Location-Based Fault Tolerant Mobile Systems. RODIN Book 2006: 168-188 - 2005
- [c13]Victor Khomenko, Alex Kondratyev, Maciej Koutny, Walter Vogler:
Merged Processes - A New Condensed Representation of Petri Net Behaviour. CONCUR 2005: 338-352 - 2004
- [j2]Victor Khomenko, Maciej Koutny, Alexandre Yakovlev:
Detecting State Encoding Conflicts in STG Unfoldings Using SAT. Fundam. Informaticae 62(2): 221-241 (2004) - [c12]Victor Khomenko, Maciej Koutny, Alexandre Yakovlev:
Logic Synthesis for Asynchronous Circuits Based on Petri Net Unfoldings and Incremental SAT. ACSD 2004: 16-25 - [c11]Claus Schröter, Victor Khomenko:
Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings. CAV 2004: 109-121 - 2003
- [j1]Victor Khomenko, Maciej Koutny, Walter Vogler:
Canonical prefixes of Petri net unfoldings. Acta Informatica 40(2): 95-118 (2003) - [c10]Josep Carmona, Jordi Cortadella, Victor Khomenko, Alexandre Yakovlev:
Synthesis of Asynchronous Hardware from Petri Nets. Lectures on Concurrency and Petri Nets 2003: 345-401 - [c9]Victor Khomenko, Maciej Koutny, Alexandre Yakovlev:
Detecting State Coding Conflicts in STG Unfoldings Using SAT. ACSD 2003: 51-60 - [c8]Agnes Madalinski, Alexandre V. Bystrov, Victor Khomenko, Alexandre Yakovlev:
Visualization and Resolution of Coding Conflicts in Asynchronous Circuit Design. DATE 2003: 10926-10931 - [c7]Victor Khomenko, Maciej Koutny:
Branching Processes of High-Level Petri Nets. TACAS 2003: 458-472 - 2002
- [c6]Victor Khomenko, Maciej Koutny, Walter Vogler:
Canonical Prefixes of Petri Net Unfoldings. CAV 2002: 582-595 - [c5]Victor Khomenko, Maciej Koutny, Alexandre Yakovlev:
Detecting State Coding Conflicts in STGs Using Integer Programming. DATE 2002: 338-345 - [c4]Keijo Heljanko, Victor Khomenko, Maciej Koutny:
Parallelisation of the Petri Net Unfolding Algorithm. TACAS 2002: 371-385 - 2001
- [c3]Victor Khomenko, Maciej Koutny:
Towards an Efficient Algorithm for Unfolding Petri Nets. CONCUR 2001: 366-380 - 2000
- [c2]Victor Khomenko, Maciej Koutny:
LP Deadlock Checking Using Partial Order Dependencies. CONCUR 2000: 410-425
1990 – 1999
- 1999
- [c1]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. Calculemus 1999: 352-369
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
