Given a Petri net N = (P, T, E), a siphon is a set S of places such that the set of input transitions to S is included in the set of output transitions from S. Concerning extraction of one or moreâ€¦ (More)

The paper proposes an approximation algorithm Y WLFS for the legal firing sequence problem, LFS for short, of Petri nets. Solving LFS has wide application to various problems, including theâ€¦ (More)

Given a Petri net PN = (P, T, E), a siphon is a set S of places such that the set of input transitions to S is included in the set of output transitions from S. Concerning extraction of minimalâ€¦ (More)

2006 IEEE International Symposium on Circuits andâ€¦

2006

The paper proposes a heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets (MAX LFS for short) and evaluates it based on experimental results. FEIDEQ is improved fromâ€¦ (More)

Detection of unruptured aneurysms is a major task in magnetic resonance angiography (MRA). However, it is difficult for radiologists to detect small aneurysms on the maximum intensity projectionâ€¦ (More)