Name
Abstract | ||
|---|---|---|
As part of our continuing research on using Petri nets to support automated analysis of Ada tasking behavior, we have investigated the application of Petri net reduction for deadlock analysis. Although reachability analysis is an important method to detect deadlocks, it is in general inefficient or even intractable. Net reduction can aid the analysis by reducing the size of the net while preserving relevant properties. We introduce a number of reduction rules and show how they can be applied to Ada nets, which are automatically generated Petri net models of Ada tasking. We define a reduction process and a method by which a useful description of a detected deadlock state can be obtained from the reduced net's information. A reduction tool and experimental results from applying the reduction process are discussed. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1109/71.553301 | IEEE Trans. Parallel Distrib. Syst. |
Keywords | Field | DocType |
ada net,reachability analysis,ada tasking deadlock analysis,deadlock analysis,reduction process,ada tasking,reduction tool,deadlock state,reduction rule,ada tasking behavior,automated analysis,petri net,software systems,communication channels,petri nets,application software,concurrent computing,ada,history,information analysis,automata,parallel programming,concurrency control | Software tool,Programming language,Petri net,Concurrency control,Concurrent engineering,Computer science,Deadlock,Automated theorem proving,Reachability,Real-time computing,Deadlock analysis,Distributed computing | Journal |
Volume | Issue | ISSN |
7 | 12 | 1045-9219 |
Citations | PageRank | References |
38 | 3.11 | 29 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sol M. Shatz | 1 | 469 | 55.25 |
| Shengru Tu | 2 | 157 | 21.71 |
| Tadao Murata | 3 | 647 | 184.06 |
| Sastry Duri | 4 | 240 | 38.30 |