Extended colored Petri net: An efficient tool for analyzing concurrent systems
| Autor: | Das, Sajal Kumar, Sarkar, Dilip, Agrawal, VK, Patnaik, LM |
|---|---|
| Rok vydání: | 1991 |
| Předmět: |
Scheme (programming language)
Information Systems and Management Computer science Concurrency Folding (DSP implementation) Petri net Net (mathematics) Computer Science Applications Theoretical Computer Science Artificial Intelligence Control and Systems Engineering Simple (abstract algebra) Stochastic Petri net computer Algorithm Computer Science & Automation Software computer.programming_language |
| Zdroj: | Information Sciences. 54:191-218 |
| ISSN: | 0020-0255 |
| DOI: | 10.1016/0020-0255(91)90051-u |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|