Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Khomenko, Victor"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Recent advances in unfolding technique
Blai Bonet
,
Patrik Haslum
,
Victor Khomenko
,
Sylvie Thiébaux
,
Walter Vogler
Theoretical Computer Science
551
, 2014, pp. 84-101
Contextual merged processes
César Rodríguez
,
Stefan Schwoon
,
Victor Khomenko
Lecture Notes in Computer Science
7927
, 2013, pp. 29-48
An algorithm for direct construction of complete merged processes
Victor Khomenko
,
Andrey Mokhov
Lecture Notes in Computer Science
6709
, 2011, pp. 89-108
STG decomposition strategies in combination with unfolding
Victor Khomenko
,
Mark Schaefer
,
Walter Vogler
,
Ralf Wollowski
Acta Informatica
46
(6), 2009, pp. 433-474
Workcraft
- A framework for Interpreted Graph Models
Ivan Poliakov
,
Victor Khomenko
,
Alex Yakovlev
Lecture Notes in Computer Science
5606
, 2009, pp. 333-342
A practical approach to verification of mobile systems using net unfoldings
Roland Meyer
,
Victor Khomenko
,
Tim Strazny
Lecture Notes in Computer Science
5062
, 2008, pp. 327-347
On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
Thomas Chatain
,
Victor Khomenko
Information Processing Letters
104
(4), 2007, pp. 129-136
Combining decomposition and unfolding for STG synthesis
Victor Khomenko
,
Mark Schaefer
Lecture Notes in Computer Science
4546
, 2007, pp. 223-243
Behaviour-preserving transition insertions in unfolding prefixes
Victor Khomenko
Lecture Notes in Computer Science
4546
, 2007, pp. 204-222
Merged processes: A new condensed representation of Petri net behaviour
Victor Khomenko
,
Alex Kondratyev
,
Maciej Koutny
,
Walter Vogler
Acta Informatica
43
(5), 2006, pp. 307-330
Canonical prefixes of Petri net unfoldings
Victor Khomenko
,
Maciej Koutny
,
Walter Vogler
Acta Informatica
40
(2), 2003, pp. 95-118