Extended Free Choice Research Articles

Implicit Places and Refactoring in Sound Acyclic Extended Free Choice Workflow Nets

Implicit Places and Refactoring in Sound Acyclic Extended Free Choice Workflow Nets

Two Sufficient Conditions on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets and Their Application

Two Sufficient Conditions on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets and Their Application

Polynomial Time Verification of Reachability in Sound Extended Free-Choice Workflow Nets

Polynomial Time Verification of Reachability in Sound Extended Free-Choice Workflow Nets

Polynomial Time Verification of Protocol Inheritance between Acyclic Extended Free-Choice Workflow Nets and Their Subnets

Polynomial Time Verification of Protocol Inheritance between Acyclic Extended Free-Choice Workflow Nets and Their Subnets

Refactoring Problem of Acyclic Extended Free-Choice Workflow Nets to Acyclic Well-Structured Workflow Nets

Refactoring Problem of Acyclic Extended Free-Choice Workflow Nets to Acyclic Well-Structured Workflow Nets

ERCN* Merged Nets for Modeling Degraded Behavior and Parallel Processes in Semiconductor Manufacturing Systems

This paper presents a new class of well-behaved Petri nets called resource control net (ERCN*) merged nets that generalize the class of ERCN merged nets proposed in a previous paper by Xie and Jeng. ERCN merged nets can model parallel and synchronized processes in semiconductor manufacturing such as lot split and lot merging, which occurs frequently in a research and development (R&D) semiconductor fab (semiconductor plant) for engineering purposes. However, processing cycles for each resource type must include the initial state of the resource type. In other words, no local processing cycles are allowed. This makes the modeling of degraded behavior in semiconductor manufacturing such as rework, failure, and maintenance difficult. In the current work, this constraint is relaxed under the extended free-choice (EFC) or asymmetric choice (AC) condition. Specifically, for each operation place with degrading outgoing arcs, the FC or AC condition is satisfied. In addition, degraded behavior is modeled as blocks within ERCNs. We show that conditions for liveness and reversibility of an ERCN* merged net correspond to the absence of unmarked siphons. The well-behaved conditions can be transformed into inequalities of the initial marking. Examples are shown to illustrate the proposed methodology.

Notes on liveness and boundedness of extended strong asymmetric choice nets II

In this paper, the Extended Strong Asymmetric Choice Nets II (ESACN II), a subclass of Asymmetric Choice Nets (ACN) including Extended Free Choice Nets (EFCN) and Strong Asymmetric Choice Nets II (SACN II), is presented. A necessary and sufficient condition for liveness of ESACN II is proposed. Moreover, a criterion is introduced, which is necessary and sufficient for judgement of liveness and boundedness of ESACN II. Meanwhile a polynomial time algorithm is given to decide liveness and boundedness for ESACN II.