#### Filter Results:

- Full text PDF available (65)

#### Publication Year

1959

2017

- This year (2)
- Last 5 years (20)
- Last 10 years (49)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Victor Khomenko
- 2003

v

- Victor Khomenko, Maciej Koutny, Walter Vogler
- Acta Informatica
- 2002

In this paper, we develop a general technique for truncating Petri net unfoldings, parameterized according to the level of information about the original unfolding one wants to preserve. Moreover, we propose a new notion of completeness of a truncated unfolding. A key aspect of our approach is an algorithm-independent notion of cut-off events, used to… (More)

- Victor Khomenko, Alex Kondratyev, Maciej Koutny, Walter Vogler
- Acta Informatica
- 2005

Model checking based on Petri net unfoldings is an approach widely applied to cope with the state space explosion problem. In this paper, we propose a new condensed representation of a Petri net’s behaviour called merged processes, which copes well not only with concurrency, but also with other sources of state space explosion, viz sequences of choices and… (More)

The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of signals. One of the crucial problems in the synthesis of such circuits is that of identifying whether an STG satisfies the Complete State Coding (CSC), Unique State Coding (USC),… (More)

- Cesar A Rodriguez, Stefan Schwoon, Victor Khomenko
- Petri Nets
- 2013

We integrate two compact data structures for representing state spaces of Petri nets: merged processes and contextual prefixes. The resulting data structure, called contextual merged processes (CMP), combines the advantages of the original ones and copes with several important sources of state space explosion: concurrency, sequences of choices, and… (More)

- Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
- ACSD
- 2004

The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of signals. One of the crucial problems in the synthesis of such circuits is deriving equations for logic gates implementing each output signal of the circuit. This is usually done… (More)

- Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
- DATE
- 2002

The paper presents a new method for checking Uniqueand Complete State Coding, the crucial conditions in thesynthesis of asynchronous control circuits from Signal TransitionGraphs (STGs). The method detects state coding conflictsin an STG using its partial order semantics (unfoldingprefix) and an integer programming technique. This leads tohuge memory… (More)

- Ivan Poliakov, Victor Khomenko, Alexandre Yakovlev
- Petri Nets
- 2009

- Victor Khomenko, Maciej Koutny
- TACAS
- 2003

In this paper, we define branching processes and unfoldings of high-level Petri nets and propose an algorithm which builds finite and complete prefixes of such unfoldings. The advantage of our method is that it avoids a potentially expensive translation of a high-level Petri net into a low-level one. The approach is conservative as all the verification… (More)

- Victor Khomenko, Maciej Koutny
- CONCUR
- 2000

Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit such a semantics is to consider (finite prefixes of) net unfoldings — themselves a class of acyclic Petri nets — which contain enough information, albeit implicit, to reason about… (More)