Applying Petri net reduction to support Ada-tasking deadlock detection
- 4 December 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The application of Petri net reduction to Ada-tasking deadlock detection is investigated. Net reduction can ease reachability analysis by reducing the size of the net while preserving relevant properties. By combining Petri net theory and knowledge of Ada-tasking semantics some specific efficient reduction rules are derived for Petri net models of Ada-tasking. A method by which a useful description of a detected deadlock state can be easily obtained from the reduced net's information is suggested.Keywords
This publication has 8 references indexed in Scilit:
- Checking properties of nets using transformationsPublished by Springer Science and Business Media LLC ,2005
- A toolkit for automated support of Ada tasking analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Detection of Ada static deadlocks using Petri net invariantsIEEE Transactions on Software Engineering, 1989
- Task interaction graphs for concurrency analysisPublished by Association for Computing Machinery (ACM) ,1989
- A petri net framework for automated static analysis of Ada tasking behaviorJournal of Systems and Software, 1988
- Describing and analyzing distributed software system designsACM Transactions on Programming Languages and Systems, 1985
- Debugging Ada Tasking ProgramsIEEE Software, 1985
- A general-purpose algorithm for analyzing concurrent programsCommunications of the ACM, 1983