Victor Khomenko, School of Computing , University of Newcastle

Selected Publications

PhD Thesis

2003

V. Khomenko: Model Checking Based on Prefixes of Petri Net Unfoldings . School of Computing Science, Newcastle University (2003). British Lending Library DSC stock location number: DXN061636.

Patents

2020

D. Sokolov, V. Khomenko, A. Yakovlev: Asynchronous Circuit. US Patent US10581435 (B1), 2020.
V. Khomenko, D. Sokolov, A. Yakovlev: Tools and Methods for Selection of Relative Timing Constraints in Asynchronous Circuits, and Asynchronous Circuits Made Thereby. US Patent US10839126 (B1), 2020.

Books and Book Chapters

2004

J. Carmona, J. Cortadella, V. Khomenko and A. Yakovlev: Synthesis of Asynchronous Hardware from Petri Nets. Desel, J., Reisig, W. and Rozenberg, G. (Eds.). Lectures on Concurrency and Petri Nets, Advances in Petri Nets, Springer-Verlag, Lecture Notes in Computer Science 3098 (2004) 345-401. ISBN: 3-540-22261-8. © Springer-Verlag. Available from SpringerLink.

2011

R. Banks, V. Khomenko, and L.J. Steggles: Modeling Genetic Regulatory Networks. Koch, I., Reisig, W. and Schreiber, F. (Eds.). Modeling in Systems Biology, Springer-Verlag, Computational Biology 16 (2011) 73-100. DOI 10.1007/978-1-84996-474-6_5. ©Springer-Verlag.

2016

D. Sokolov, V. Khomenko, A. Mokhov: Workcraft: Ten Years Later. A. Mokhov (Ed.). This Asynchronous World. Essays Dedicated to Alex Yakovlev on the Occasion of His 60th Birthday. Newcastle University. (2016) 269-293. ISBN: 978-0-7017-0257-1.

2018

V. Khomenko (Ed.): Harnessed Causality: Essays Dedicated to Maciej Koutny on the Occasion of His 60th Birthday. Harnessed Causality: Essays Dedicated to Maciej Koutny on the Occasion of His 60th Birthday. Newcastle University (2018). ISBN: 978-0-7017-0266-3.

P. Jancar and V. Khomenko: Complexity of Checking Output-Determinacy in General Petri Nets. V. Khomenko (Ed.). Harnessed Causality: Essays Dedicated to Maciej Koutny on the Occasion of His 60th Birthday. Newcastle University (2018) 73-83. ISBN: 978-0-7017-0266-3.

Journal Papers

2002

A. Letichevsky and V. Khomenko: A Rewriting Machine and Optimization of Strategies of Term Rewriting . Kluwer Academic Publishers, Cybernetics and System Analysis 38(5) (2002) 637-649. © 2002 Plenum Publishing Corporation.

2003

A. Madalinski, A. Bystrov, V. Khomenko and A. Yakovlev: Visualization and Resolution of Coding Conflicts in Asynchronous Circuit Design. Special Issue on Best Papers from DATE'2003, IEE Proceedings: Computers & Digital Techniques 150(5) (2003) 285-293. © IEE 2003. The original publication is available here .
V. Khomenko, M. Koutny and V. Vogler: Canonical Prefixes of Petri Net Unfoldings. Springer-Verlag, Acta Informatica 40(2) (2003) 95-118. © Springer-Verlag. Available from SpringerLink .

2004

V. Khomenko, M. Koutny and A. Yakovlev: Detecting State Coding Conflicts in STG Unfoldings Using SAT. Special Issue on Best Papers from ACSD'2003, IOS Press, Fundamenta Informaticae 62(2) (2004) 1-21.
V. Khomenko: Weasel Words, Genetic Algorithms and Coarse Acknowledgements . TJ 18(1) (2004) 78-85.

2006

V. Khomenko, M. Koutny and A. Yakovlev: Logic Synthesis for Asynchronous Circuits Based on Petri Net Unfoldings and Incremental SAT. Special Issue on Best Papers from ACSD'2004, IOS Press, Fundamenta Informaticae 70(1-2) (2006) 49-73.
V. Khomenko, A. Kondratyev, M. Koutny and V. Vogler: Merged Processes - a New Condensed Representation of Petri Net Behaviour. Springer-Verlag, Acta Informatica 43(5) (2006) 307-330. Available from SpringerLink.

2007

V. Khomenko and M. Koutny: Verification of Bounded Petri Nets Using Integer Programming. Springer-Verlag, Formal Methods in System Design 30(2) (2007) 143-176. Available from SpringerLink.
T. Chatain and V. Khomenko: On the Well-Foundedness of Adequate Orders Used for Construction of Complete Unfolding Prefixes. Elsevier Press, Information Processing Letters 104(4) (2007) 129-136. Available from ScienceDirect.

2008

V. Khomenko, A. Madalinski and A. Yakovlev: Resolution of Encoding Conflicts by Signal Insertion and Concurrency Reduction Based on STG Unfoldings. Special Issue on Best Papers from ACSD'2006, IOS Press, Fundamenta Informaticae 86(3) (2008) 299-323.
V. Khomenko, M. Schaefer and W. Vogler: Output-Determinacy and Asynchronous Circuit Synthesis. Special Issue on Best Papers from ACSD'2007, IOS Press, Fundamenta Informaticae 88(4) (2008) 541-579.

2009

V. Khomenko: Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings. Special Section on Asynchronous Circuits and Systems, Joint Publication of IEEE Circuits and Systems Society, IEEE Computer Society and IEEE Solid-State Circuits Society, IEEE Transactions on Very Large Scale Integration (VLSI) Systems 17(7) (2009) 855-868.
V. Khomenko, M. Schaefer, W. Vogler and R. Wollowski: STG Decomposition Strategies in Combination with Unfolding. Springer-Verlag, Acta Informatica 46(6) (2009) 433-474.
R. Meyer, V. Khomenko and T. Strazny: A Practical Approach to Verification of Mobile Systems Using Net Unfoldings. Special Issue on Best Papers from ATPN'2008, IOS Press, Fundamenta Informaticae 94(3-4) (2009) 439-471.

2011

A. Mokhov, V. Khomenko and A. Yakovlev: Flat Arbiters. Special Issue on Best Papers from ACSD'2009, IOS Press, Fundamenta Informaticae 108(1-2) (2011) 63-90.

2013

V. Khomenko, R. Meyer and R. Hüchting: Polynomial Translation of pi-calculus FCPs to Safe Petri Nets. Special Issue on Best Papers from CONCUR'2012, Logical Methods in Computer Science 9(3) (2013) 1-36. DOI: 10.2168/LMCS-9(3:18)2013.

2014

V. Khomenko and A. Mokhov: Direct Construction of Complete Merged Processes. Oxford University Press, The Computer Journal 57(5) (2014) 693-707. DOI: 10.1093/comjnl/bxt014. First published online: 18 February 2013.
B. Bonet, P. Haslum, V. Khomenko, S. Thiébaux and W. Vogler: Recent Advances in Unfolding Technique. Elsevier, Theoretical Computer Science 551 (2014) 84-101. DOI: 10.1016/j.tcs.2014.07.003.
A. Mokhov and V. Khomenko: Algebra of Parameterised Graphs. Special Issue on Best Papers from ACSD'2012, ACM Press, ACM Transactions on Embedded Computing Systems 13(4s) (2014). Article No. 143. DOI: 10.1145/2627351.

2015

L. Jezequel, E. Fabre and V. Khomenko: Factored Planning: From Automata to Petri Nets. Special Issue on Best Papers from ACSD'2012, ACM Press, ACM Transactions on Embedded Computing Systems 14(2) (2015). Article No. 26. DOI: 10.1145/2656215.
V. Khomenko and V. Germanos: Modelling and Analysis Mobile Systems Using π-calculus (EFCP). Springer Verlag, LNCS Transactions on Petri Nets and Other Models of Concurrency (ToPNoC) 9410 (2015) 153-175. DOI: 10.1007/978-3-662-48650-4_8.
V. Germanos, S. Haar, V. Khomenko and S. Schwoon: Diagnosability under Weak Fairness. Special Issue on Best Papers from ACSD'2014, ACM Press, ACM Transactions on Embedded Computing Systems 14(4) (2015). Article No. 69. DOI: 10.1145/2832910.

2019

D. Sokolov, V. Khomenko, A. Mokhov, V. Dubikhin, D. Lloyd and A. Yakovlev: Automating the Design of Asynchronous Logic Control for AMS Electronics. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39(5) (2019) 952-965. DOI: 10.1109/TCAD.2019.2907905. Print ISSN: 0278-0070. Online ISSN: 1937-4151.

2022

A. Chan, D. Sokolov, V. Khomenko, D. Lloyd and A. Yakovlev: Burst Automaton: Framework for Speed-Independent Synthesis using Burst-Mode Specifications. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, accepted paper.

Conference Papers

2000

V. Khomenko and M. Koutny: LP Deadlock Checking Using Partial Order Dependencies . Proc. of CONCUR'2000, Palamidessi C. (Ed.). Springer-Verlag, Lecture Notes in Computer Science 1877 (2000) 410-425. © Springer-Verlag. Available from SpringerLink. [ slides ] [ examples ]

2001

V. Khomenko and M. Koutny: Towards An Efficient Algorithm for Unfolding Petri Nets . Proc. of CONCUR'2001, Larsen K.G., Nielsen M. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 2154 (2001) 366-380. © Springer-Verlag. Available from SpringerLink. [ slides (PowerPoint) ]

2002

V. Khomenko, M. Koutny and A. Yakovlev: Detecting State Coding Conflicts in STGs Using Integer Programming . Proc. of DATE'2002, Kloos C.D., Franca J. (Eds.). IEEE Computing Society Press (2002) 338-345. [ slides (PowerPoint) ]
K. Heljanko, V. Khomenko and M. Koutny: Parallelisation of the Petri Net Unfolding Algorithm . Proc. of TACAS'2002, Katoen, J.-P., Stevens, P. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 2280 (2002) 371-385. © Springer-Verlag. Available from SpringerLink. [ slides (PowerPoint) ]
V. Khomenko, M. Koutny and W. Vogler: Canonical Prefixes of Petri Net Unfoldings . Proc. of CAV'2002, Brinksma E., Larsen K.G. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 2404 (2002) 582-596. © Springer-Verlag. Available from SpringerLink. [ slides (PowerPoint) ]

2003

A. Madalinski, A. Bystrov, V. Khomenko and A. Yakovlev: Visualization and Resolution of Coding Conflicts in Asynchronous Circuit Design . Proc. of DATE'2003. IEEE Computing Society Press (2003) 926-931. Selected as one of best papers. [ slides (PowerPoint) ]
V. Khomenko and M. Koutny: Branching Processes of High-Level Petri Nets . Proc. of TACAS'2003, Garavel, H., Hatcliff, J. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 2619 (2003) 458-472. © Springer-Verlag. Available from SpringerLink. [ slides (PowerPoint) ]
V. Khomenko, M. Koutny and A. Yakovlev: Detecting State Coding Conflicts in STG Unfoldings Using SAT . Proc. of ACSD'2003, Lilius, J., Balarin, F. and Machado R.J. (Eds.). IEEE Computing Society Press (2003) 51-60. Selected as one of best papers. [ slides (PowerPoint) ]

2004

V. Khomenko, M. Koutny and A. Yakovlev: Logic Synthesis for Asynchronous Circuits Based on Petri Net Unfoldings and Incremental SAT . Proc. of ACSD'2004, Kishinevsky M. and Darondeau, Ph. (Eds.). IEEE Computing Society Press (2004) 16-25. Best paper award. [ slides (PowerPoint) ]
C. Schröter and V. Khomenko: Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings . Proc. of CAV'2004, Alur, R. and Peled, D.A. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 3114 (2004) 109-121. © Springer-Verlag. Available from SpringerLink. [ slides (PowerPoint) ]

2005

V. Khomenko, A. Kondratyev, M. Koutny and W. Vogler: Merged Processes - a New Condensed Representation of Petri Net Behaviour . Proc. of CONCUR'2005, Abadi, M. and Alfaro, L. de (Eds.). Springer-Verlag, Lecture Notes in Computer Science 3653 (2005) 338-352. © Springer-Verlag. Available from SpringerLink. [ slides (PowerPoint) ]

2006

V. Khomenko, A. Madalinski and A. Yakovlev: Resolution of Encoding Conflicts by Signal Insertion and Concurrency Reduction Based on STG Unfoldings . Proc. of ACSD'2006, Goossens, K. and Petrucci, L. (Eds.). IEEE Computing Society Press (2006) 57-66. Selected as one of best papers. [ slides (PowerPoint) ]
M. Schaefer, W. Vogler, R. Wollowski and V. Khomenko: Strategies for Optimised STG Decomposition . Proc. of ACSD'2006, Goossens, K. and Petrucci, L. (Eds.). IEEE Computing Society Press (2006) 123-132. [ slides (PDF) ]

2007

V. Khomenko: Behaviour-Preserving Transition Insertions in Unfolding Prefixes. Proc. of ATPN'2007, Kleijn, J. and Yakovlev, A. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 4546 (2007) 204-222. © Springer-Verlag. Available from SpringerLink . [ slides (PowerPoint) ]
V. Khomenko and M. Schaefer: Combining Decomposition and Unfolding for STG Synthesis. Proc. of ATPN'2007, Kleijn, J. and Yakovlev, A. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 4546 (2007) 223-243. © Springer-Verlag. Available from SpringerLink . [ slides (PowerPoint) ]
V. Khomenko: Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings. Proc. of ACSD'2007, Basten, T. and Shukla, S. (Eds.). IEEE Computing Society Press (2007) 137-146. [ slides (PowerPoint) ]
V. Khomenko, M. Schaefer and W. Vogler: Output-Determinacy and Asynchronous Circuit Synthesis. Proc. of ACSD'2007, Basten, T. and Shukla, S. (Eds.). IEEE Computing Society Press (2007) 147-156. Selected as one of best papers. [ slides (PDF) ]

2008

V. Khomenko: Derivation of Monotonic Covers for Standard-C Implementation Using STG Unfoldings. Proc. of ASYNC'2008, Cortadella, J. and Taubin, A. (Eds.). IEEE Computing Society Press (2008) 141-150. [ slides (PowerPoint) ]
R. Meyer, V. Khomenko and T. Strazny: A Practical Approach to Verification of Mobile Systems Using Net Unfoldings. Proc. of ATPN'2008, Valk, R. and van Hee, K. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 5062 (2008) 327-347. © Springer-Verlag. Available from SpringerLink . Selected as one of best papers. [ slides (PDF) ]

2009

R. Banks, V. Khomenko, and L.J. Steggles: A Case for Using Signal Transition Graphs for Analysing and Refining Genetic Networks. Proc. of MeCBIC'2008. ENTCS 227 (2009) 3-19. Available from ScienceDirect. [ slides (PowerPoint) ]
V. Khomenko and R. Meyer: Checking pi-Calculus Structural Congruence is Graph Isomorphism Complete. Proc. ACSD'2009, Edwards, S., Lorenz, R. and Vogler, W. (Eds.). IEEE Computing Society Press (2009) 70-79. [ slides (PowerPoint) ]
A. Mokhov, V. Khomenko and A. Yakovlev: Flat Arbiters. Proc. ACSD'2009, Edwards, S., Lorenz, R. and Vogler, W. (Eds.). IEEE Computing Society Press (2009) 99-108. Selected as one of best papers. [ slides (PowerPoint) ]
I. Poliakov, V. Khomenko and A. Yakovlev: Workcraft - a Framework for Interpreted Graph Models. Proc. ATPN'2009, Franceschinis, G. and Wolf, K. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 5606 (2009) 333-342. © Springer-Verlag. Available from SpringerLink . [ slides (PDF) ]

2010

V. Khomenko: A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes. Proc. ICGT'2010, Ehrig, H., Rensink, A. and Schürr, A. (Eds.). Springer Verlag, Lecture Notes in Computer Science 6372 (2010) 75-90. [ slides (PowerPoint) ]
A. Madalinski and V. Khomenko: Diagnosability Verification with Parallel LTL-X Model Checking Based on Petri Net Unfoldings. Proc. SysTol'2010, Korbicz, J. and Theillioli, D. (Eds.). IEEE Computing Society Press (2010) 398-403. [ slides (PowerPoint) ]

2011

V. Khomenko: Logic Decomposition of Asynchronous Circuits Using STG Unfoldings. Proc. of ASYNC'2011, Bainbridge, J. and Jones, I. (Eds.). IEEE Computing Society Press (2011) 3-12. [ slides (PowerPoint) ]
V. Khomenko and A. Mokhov: An Algorithm for Direct Construction of Complete Merged Processes. Proc. Petri Nets'2011, Kristensen, L.M. and Petrucci, L. (Eds.). Springer Verlag, Lecture Notes in Computer Science 6709 (2011) 89-108. [ slides (PowerPoint) ]
A. Alekseyev, V. Khomenko, A. Mokhov, D. Wist and A. Yakovlev: Improved parallel composition of labelled Petri nets. Proc. ACSD'2011, Caillaud, B. and Carmona, J. (Eds.). IEEE Computing Society Press (2011) 131-140. [ slides (PDF) ]

2012

A. Mokhov, V. Khomenko, A. Alekseyev and A. Yakovlev: Algebra of Parametrised Graphs. Proc. of ACSD'2012, Brandt, J. and Heljanko, K. (Eds.). IEEE Computing Society Press (2012) 22-31. Selected as one of best papers. [ slides (PowerPoint) ]
A. Mokhov, V. Khomenko, D. Sokolov and A. Yakovlev: On Dual-Rail Control Logic for Enhanced Circuit Robustness. Proc. of ACSD'2012, Brandt, J. and Heljanko, K. (Eds.). IEEE Computing Society Press (2012) 112-121. [ slides (PowerPoint) ]
A. Madalinski and V. Khomenko: Predictability Verification with Parallel LTL-X Model Checking Based on Petri Net Unfoldings. Proc. of SAFEPROCESS'2012, Lunze, J. (Ed.). (2012) 1232-1237. [ slides (PowerPoint) ]
R. Meyer, V. Khomenko and R. Hüchting: A Polynomial Translation of Pi-calculus (FCP) to Safe Petri Nets. Proc. of CONCUR'2012, Koutny, M. and Ulidowski, I. (Eds.). Springer-Verlag, Lecture Notes in Computer Science 7454 (2012) 440-455. Selected as one of best papers. [ slides (PowerPoint) ]

2013

C. Rodriguez, S. Schwoon and V. Khomenko: Contextual Merged Processes. Proc. of Petri Nets'2013, Colom, J.M. and Desel, J. (Eds.). Springer Verlag, Lecture Notes in Computer Science 7927 (2013) 29-48.
L. Jezequel, E. Fabre and V. Khomenko: Factored Planning: From Automata to Petri Nets. Proc. of ACSD'2013, Pietkiewicz-Koutny, M. and Lazarescu, M. (Eds.). IEEE Computing Society Press (2013) 137-146. Selected as one of best papers. [ slides (PDF) ]

2014

V. Germanos, S. Haar, V. Khomenko and S. Schwoon: Diagnosability under Weak Fairness. Proc. of ACSD'2014, Mokhov, A. and Bernardinello, L. (Eds.). IEEE Computing Society Press (2014) 132-141. Selected as one of best papers, nominated for the best paper award. [ slides (PowerPoint) ]

2015

D. Sokolov, V. Khomenko, A. Mokhov, A. Yakovlev, D. Lloyd: Design and Verification of Speed-Independent Multiphase Buck Controller. Proc. of ASYNC'2015, IEEE Computing Society Press (2015) 29-36. DOI: 10.1109/ASYNC.2015.14. [ slides (PDF) ]
A. Mokhov, V. Khomenko, D. Sokolov, A. Yakovlev: Opportunistic Merge Element. Proc. of ASYNC'2015, IEEE Computing Society Press (2015) 116-123. DOI: 10.1109/ASYNC.2015.25. [ slides (PDF) ]

2017

D. Sokolov,V. Dubikhin, V. Khomenko, D. Lloyd, A. Mokhov, A. Yakovlev: Benefits of Asynchronous Control for Analog Electronics: Multiphase Buck Case Study. Proc. of DATE'2017, IET Proceedings: Computers & Digital Techniques (2017) 1751-1756. DOI: 10.23919/DATE.2017.7927276. [ slides (PDF) ]
V. Khomenko, D. Sokolov, A. Mokhov, A. Yakovlev: WAITX: An Arbiter for Non-Persistent Signals. Proc. of ASYNC'2017, IEEE Computing Society Press (2017) 33-40. DOI: 10.1109/ASYNC.2017.8. Nominated for the best paper award. [ slides (PowerPoint) ]
A. Mokhov, D. Sokolov, V. Khomenko, A. Yakovlev: Asynchronous Arbitration Primitives for New Generation of Circuits and Systems. Proc. of New Generation of Circuits and Systems (NGCAS'2017). [ slides (PDF) ]
V. Khomenko, A. Mokhov, D. Sokolov, A. Yakovlev: Formal Design and Verification of an Asynchronous SRAM Controller. Proc. of ACSD'17, IEEE Computing Society Press (2017) 59-67. DOI: 10.1109/ACSD.2017.12. [ slides (PowerPoint) ]

2018

D. Sokolov, V. Khomenko, A. Yakovlev, D. LLoyd: Design and Verification of Speed-Independent Circuits with Arbitration in Workcraft. Proc. of ASYNC'2018, IEEE (2018) 30-31. DOI: 10.1109/ASYNC.2018.00017. [ slides (PowerPoint) ]

2020

V. Khomenko, D. Sokolov, A. Yakovlev, D. LLoyd: Handshake Verification in Workcraft. Proc. of ASYNC'2020, IEEE (2020) 63-64. DOI: 10.1109/ASYNC49171.2020.00016.

2021

A. Chan, D. Sokolov, V. Khomenko, D. Lloyd, A. Yakovlev: Synthesis of SI Circuits from Burst-Mode Specifications. Proc. of DATE'2021, IEEE (2021) 366-369. DOI: 10.23919/DATE51398.2021.9474117.

2022

V. Khomenko, M. Koutny, A. Yakovlev: Avoiding Exponential Explosion in Petri Net Models of Control Flows. Proc. of Petri Nets'2022, Goos, G. and Hartmanis, J. (Eds.). Springer Verlag, Lecture Notes in Computer Science 13288 (2022) 261-277. DOI: 10.1007/978-3-031-06653-5_14.
V. Khomenko, M. Koutny, A. Yakovlev: Slimming Down Petri Boxes: Compact Petri Net Models of Control Flows. Proc. of CONCUR'2022, Klin, B., Lasota, S., and Muscholl, A. (Eds.). Leibniz International Proceedings in Informatics (LIPIcs) 243 (2022) 8:1-8:16. DOI: 10.4230/LIPIcs.CONCUR.2022.8.

Workshop Papers

2005

A. Iliasov, V. Khomenko, M. Koutny and A. Romanovsky: On Specification and Verification of Location-Based Fault Tolerant Mobile Systems . Proc. of REFT'2005, Technical Report CS-TR-915, School of Computing Science, Newcastle University (2005) 129-140 & Springer LNCS 4157 (2006) 168-188. [ slides (PowerPoint) ]
V. Khomenko: Shortest Violation Traces in Model Checking Based on Petri Net Unfoldings and SAT . Proc. of REFT'2005, Technical Report CS-TR-915, School of Computing Science, Newcastle University (2005) 141-155. [ slides (PowerPoint) ]

2006

V. Khomenko, M. Koutny and A. Niaouris: Applying Petri Net Unfoldings for Verification of Mobile Systems . Proc. of MOCA'2006, Moldt, D. (Ed.). Technical Report 272, Computing Science Department, University of Hamburg (2006) 161-178. [ slides (PowerPoint) ]

2009

V. Khomenko: A Usable Reachability Analyser . Proc. of 21st UK Asynchronous Forum'2009, Yakovlev, A. (Ed.). Computer Science Department, University of Bristol (2009). [ slides (PowerPoint) ]
A. Alekseyev, I. Poliakov, V. Khomenko and A. Yakovlev: Optimisation of Balsa control path using STG resynthesis . Proc. of 21st UK Asynchronous Forum'2009, Yakovlev, A. (Ed.). Computer Science Department, University of Bristol (2009). [ slides (PDF) ]

Technical Reports

2000

V. Khomenko and M. Koutny: Deadlock Checking Using Linear Programming and Partial Order Dependencies . Technical Report CS-TR-695, School of Computing Science, Newcastle University (2000).
V. Khomenko and M. Koutny: Verification of Bounded Petri Nets Using Integer Programming . Technical Report CS-TR-711, School of Computing Science, Newcastle University (2000).

2001

V. Khomenko and M. Koutny: An Efficient Algorithm for Unfolding Petri Nets . Technical Report CS-TR-726, School of Computing Science, Newcastle University (2001).
K. Heljanko, V. Khomenko and M. Koutny: Parallelisation of the Petri Net Unfolding Algorithm . Technical Report CS-TR-733, School of Computing Science, Newcastle University (2001).
V. Khomenko, M. Koutny and A. Yakovlev: Detecting State Coding Conflicts in STGs Using Integer Programming . Technical Report CS-TR-736, School of Computing Science, Newcastle University (2001).
V. Khomenko, M. Koutny and W. Vogler: Canonical Prefixes of Petri Net Unfoldings . Technical Report CS-TR-741, School of Computing Science, Newcastle University (2001).

2002

V. Khomenko and M. Koutny: Branching Processes of High-Level Petri Nets . Technical Report CS-TR-763, School of Computing Science, Newcastle University (2002).
V. Khomenko, M. Koutny and A. Yakovlev: Detecting State Coding Conflicts in STG Unfoldings Using SAT . Technical Report CS-TR-778, School of Computing Science, Newcastle University (2002).

2003

V. Khomenko, M. Koutny and A. Yakovlev: Logic Synthesis Avoiding State Space Explosion . Technical Report CS-TR-813, School of Computing Science, Newcastle University (2003).

2004

V. Khomenko: Computing Shortest Violation Traces in Model Checking Based on Petri Net Unfoldings and SAT . Technical Report CS-TR-841, School of Computing Science, Newcastle University (2004).
V. Khomenko, A. Madalinski and A. Yakovlev: Resolution of Encoding Conflicts by Signal Insertion and Concurrency Reduction Based on STG Unfoldings . Technical Report CS-TR-858, School of Computing Science, Newcastle University (2004).

2005

V. Khomenko, A. Kondratyev, M. Koutny and W. Vogler: Merged Processes - a New Condensed Representation of Petri Net Behaviour . Technical Report CS-TR-884, School of Computing Science, Newcastle University (2005).
V. Khomenko: Derivation of Set and Reset Covers for gC Elements and Standard C Implementation Using STG Unfoldings . Technical Report CS-TR-930, School of Computing Science, Newcastle University (2005).

2006

A. Madalinski, V. Khomenko and A. Yakovlev: Interactive Resolution of Encoding Conflicts in Asynchronous Circuits Based on STG Unfoldings . Technical Report CS-TR-944, School of Computing Science, Newcastle University (2006).
V. Khomenko: Behaviour-Preserving Transition Insertions in Unfolding Prefixes . Technical Report CS-TR-952, School of Computing Science, Newcastle University (2006).
V. Khomenko, M. Koutny and A. Niaouris: Applying Petri Net Unfoldings for Verification of Mobile Systems . Technical Report CS-TR-953, School of Computing Science, Newcastle University (2006).

2007

V. Khomenko: Efficient Automatic Resolution of Encoding Conflicts Using STG Unfoldings . Technical Report CS-TR-995, School of Computing Science, Newcastle University (2007).
V. Khomenko and M. Schaefer: Combining Decomposition and Unfolding for STG Synthesis . Technical Report 2007-01, Institute of Computer Science, University of Augsburg (2007).
V. Khomenko, M. Schaefer and W. Vogler: Output-Determinacy and Asynchronous Circuit Synthesis . Technical Report 2007-02, Institute of Computer Science, University of Augsburg (2007).
T. Chatain and V. Khomenko: A Note on the Well-Foundedness of Adequate Orders Used for Truncating Unfoldings . Technical Report CS-TR-998, School of Computing Science, Newcastle University (2007).

2008

R. Meyer, V. Khomenko and T. Strazny: A Practical Approach to Verification of Mobile Systems Using Net Unfoldings . Technical Report CS-TR-1064, School of Computing Science, Newcastle University (2008).
R. Banks, V. Khomenko and J. Steggles: A Case for Using Signal Transition Graphs for Analysing and Refining Genetic Networks . Technical Report CS-TR-1086, School of Computing Science, Newcastle University (2008).
V. Khomenko and R. Meyer: Checking pi-Calculus Structural Congruence is Graph Isomorphism Complete . Technical Report CS-TR-1100, School of Computing Science, Newcastle University (2008).

2009

V. Khomenko: A Usable Reachability Analyser . Technical Report CS-TR-1140, School of Computing Science, Newcastle University (2009).

2010

V. Khomenko: A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixes . Technical Report CS-TR-1189, School of Computing Science, Newcastle University (2010).
V. Khomenko: Logic Decomposition of Asynchronous Circuits Using STG Unfoldings . Technical Report CS-TR-1215, School of Computing Science, Newcastle University (2010).
A. Mokhov, V. Khomenko, D. Sokolov and A. Yakovlev: On Dual-Rail Control Logic for Enhanced Circuit Robustness . Technical Report NCL-EECE-MSD-TR-2010-162, School of Electrical, Electronic & Computer Engineering, Newcastle University (2010).
V. Khomenko and A. Mokhov: An Algorithm for Direct Construction of Complete Merged Processes . Technical Report CS-TR-1231, School of Computing Science, Newcastle University (2010).

2011

A. Madalinski and V. Khomenko: Predictability Verification with Parallel LTL-X Model Checking Based on Petri Net Unfoldings . Technical Report CS-TR-1276, School of Computing Science, Newcastle University (2011).
A. Mokhov, V. Khomenko, A. Alekseyev and A. Yakovlev: Algebra of Parametrised Graphs . Technical Report CS-TR-1307, School of Computing Science, Newcastle University (2011).

2012

R. Meyer, V. Khomenko and R. Hüchting: A Polynomial Translation of π-Calculus (FCP) to Safe Petri Nets . Technical Report CS-TR-1323, School of Computing Science, Newcastle University (2012).

2013

C. Rodríguez and S. Schwoon and V. Khomenko: Contextual Merged Processes . Technical Report LSV-13-06, LSV, ENS de Cachan (2013).

2015

A. Mokhov, V. Khomenko, D. Sokolov, A. Yakovlev: Opportunistic Merge Element . Technical Report NCL-EEE-MICRO-TR-2015-196, μSystems Research Group, School of EEE, Newcastle University (2015).

Victor.Khomenko@ncl.ac.uk