Das, Sajal K and Sarkar, Dilip and Agrawal, VK and Patnaik, LM (1991) Extended colored Petri net: An efficient tool for analyzing concurrent systems. In: Information Sciences, 54 (3). pp. 191-218.Full text not available from this repository.
This paper proposes a novel and simple definition of general colored Petri nets. This definition is coherent with that of (uncolored) Petri nets, preserves the reflexivity of the original net and is extended to represent inhibitors. Also suggested are systematic and formal merging rules to obtain a well-formed structure of the extended colored Petri net by folding a given uncolored net. Finally, we present a technique to compute colored invariants by selecting colored RP-subnets. On the average, the proposed technique performs better than the existing ones. The analysis procedure is explained through an illustrative example of a three-level interrupt-priority-handler scheme.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier science.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||16 Nov 2010 07:30|
|Last Modified:||16 Nov 2010 07:30|
Actions (login required)