#### Filter Results:

#### Publication Year

1999

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

In this paper, we develop a general technique for truncating Petri net un-foldings, 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, which with the standard parameters is strictly stronger than that given in [5, 6], and is more… (More)

- Victor Khomenko
- 2003

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)

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)

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)

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, which contain enough information to reason about the reachable markings of the original Petri nets. In this… (More)

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 the other sources of state space explosion, viz. sequences of choices… (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 deriving equations for logic gates implementing each output signal of the circuit. This is usually done… (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)

In this paper, we first present theoretical results, helping to understand the unfolding algorithm presented in [5, 6]. We then propose a modification of this algorithm, which can be efficiently parallelised, and prove its correctness. We also present additional optimisations.