An application of Petri net reduction for Ada tasking deadlock analysis
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...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on parallel and distributed systems 1996-12, Vol.7 (12), p.1307-1322 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1322 |
|---|---|
| container_issue | 12 |
| container_start_page | 1307 |
| container_title | IEEE transactions on parallel and distributed systems |
| container_volume | 7 |
| creator | Shatz, S.M. Shengru Tu Murata, T. Duri, S. |
| description | 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. |
| doi_str_mv | 10.1109/71.553301 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_71_553301</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>553301</ieee_id><sourcerecordid>26300594</sourcerecordid><originalsourceid>FETCH-LOGICAL-c337t-76ee37ffec8486df41c993e5c2af3fa3d9f08cbec78a97ded64a73d94d4bf4533</originalsourceid><addsrcrecordid>eNqFkDFPwzAQhS0EEqUwsDJ5QEgMKXZsx_FYVVCQKsEAc3S1z8g0TYKdDv33pKRiZbrTu--e9B4h15zNOGfmQfOZUkIwfkImXKkyy3kpToedSZWZnJtzcpHSF2NcKiYnZDlvKHRdHSz0oW1o6-kb9jHQBnsa0e3sr-zbSOcOaA9pE5pP6hBc3doNhQbqfQrpkpx5qBNeHeeUfDw9vi-es9Xr8mUxX2VWCN1nukAU2nu0pSwL5yW3xghUNgcvPAhnPCvtGq0uwWiHrpCgB1U6ufZyCDYld6NvF9vvHaa-2oZksa6hwXaXqrwcculC_g8WgjFlDuD9CNrYphTRV10MW4j7irPq0GmleTV2OrC3R1NIFmofobEh_T3kSjEmigG7GbGAiH_Xo8cPNWZ-Bw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>26300594</pqid></control><display><type>article</type><title>An application of Petri net reduction for Ada tasking deadlock analysis</title><source>IEEE Electronic Library (IEL)</source><creator>Shatz, S.M. ; Shengru Tu ; Murata, T. ; Duri, S.</creator><creatorcontrib>Shatz, S.M. ; Shengru Tu ; Murata, T. ; Duri, S.</creatorcontrib><description>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.</description><identifier>ISSN: 1045-9219</identifier><identifier>EISSN: 1558-2183</identifier><identifier>DOI: 10.1109/71.553301</identifier><identifier>CODEN: ITDSEO</identifier><language>eng</language><publisher>Los Alamitos, CA: IEEE</publisher><subject>Application software ; Applied sciences ; Automata ; Communication channels ; Computer displays ; Computer science; control theory; systems ; Concurrent computing ; Control system analysis ; Control system synthesis ; Control theory. Systems ; Exact sciences and technology ; FETs ; History ; Information analysis ; Software ; Software engineering ; Software systems ; System recovery</subject><ispartof>IEEE transactions on parallel and distributed systems, 1996-12, Vol.7 (12), p.1307-1322</ispartof><rights>1997 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c337t-76ee37ffec8486df41c993e5c2af3fa3d9f08cbec78a97ded64a73d94d4bf4533</citedby><cites>FETCH-LOGICAL-c337t-76ee37ffec8486df41c993e5c2af3fa3d9f08cbec78a97ded64a73d94d4bf4533</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/553301$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27922,27923,54756</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/553301$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2550036$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Shatz, S.M.</creatorcontrib><creatorcontrib>Shengru Tu</creatorcontrib><creatorcontrib>Murata, T.</creatorcontrib><creatorcontrib>Duri, S.</creatorcontrib><title>An application of Petri net reduction for Ada tasking deadlock analysis</title><title>IEEE transactions on parallel and distributed systems</title><addtitle>TPDS</addtitle><description>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.</description><subject>Application software</subject><subject>Applied sciences</subject><subject>Automata</subject><subject>Communication channels</subject><subject>Computer displays</subject><subject>Computer science; control theory; systems</subject><subject>Concurrent computing</subject><subject>Control system analysis</subject><subject>Control system synthesis</subject><subject>Control theory. Systems</subject><subject>Exact sciences and technology</subject><subject>FETs</subject><subject>History</subject><subject>Information analysis</subject><subject>Software</subject><subject>Software engineering</subject><subject>Software systems</subject><subject>System recovery</subject><issn>1045-9219</issn><issn>1558-2183</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1996</creationdate><recordtype>article</recordtype><recordid>eNqFkDFPwzAQhS0EEqUwsDJ5QEgMKXZsx_FYVVCQKsEAc3S1z8g0TYKdDv33pKRiZbrTu--e9B4h15zNOGfmQfOZUkIwfkImXKkyy3kpToedSZWZnJtzcpHSF2NcKiYnZDlvKHRdHSz0oW1o6-kb9jHQBnsa0e3sr-zbSOcOaA9pE5pP6hBc3doNhQbqfQrpkpx5qBNeHeeUfDw9vi-es9Xr8mUxX2VWCN1nukAU2nu0pSwL5yW3xghUNgcvPAhnPCvtGq0uwWiHrpCgB1U6ufZyCDYld6NvF9vvHaa-2oZksa6hwXaXqrwcculC_g8WgjFlDuD9CNrYphTRV10MW4j7irPq0GmleTV2OrC3R1NIFmofobEh_T3kSjEmigG7GbGAiH_Xo8cPNWZ-Bw</recordid><startdate>19961201</startdate><enddate>19961201</enddate><creator>Shatz, S.M.</creator><creator>Shengru Tu</creator><creator>Murata, T.</creator><creator>Duri, S.</creator><general>IEEE</general><general>IEEE Computer Society</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19961201</creationdate><title>An application of Petri net reduction for Ada tasking deadlock analysis</title><author>Shatz, S.M. ; Shengru Tu ; Murata, T. ; Duri, S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c337t-76ee37ffec8486df41c993e5c2af3fa3d9f08cbec78a97ded64a73d94d4bf4533</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1996</creationdate><topic>Application software</topic><topic>Applied sciences</topic><topic>Automata</topic><topic>Communication channels</topic><topic>Computer displays</topic><topic>Computer science; control theory; systems</topic><topic>Concurrent computing</topic><topic>Control system analysis</topic><topic>Control system synthesis</topic><topic>Control theory. Systems</topic><topic>Exact sciences and technology</topic><topic>FETs</topic><topic>History</topic><topic>Information analysis</topic><topic>Software</topic><topic>Software engineering</topic><topic>Software systems</topic><topic>System recovery</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shatz, S.M.</creatorcontrib><creatorcontrib>Shengru Tu</creatorcontrib><creatorcontrib>Murata, T.</creatorcontrib><creatorcontrib>Duri, S.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on parallel and distributed systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Shatz, S.M.</au><au>Shengru Tu</au><au>Murata, T.</au><au>Duri, S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An application of Petri net reduction for Ada tasking deadlock analysis</atitle><jtitle>IEEE transactions on parallel and distributed systems</jtitle><stitle>TPDS</stitle><date>1996-12-01</date><risdate>1996</risdate><volume>7</volume><issue>12</issue><spage>1307</spage><epage>1322</epage><pages>1307-1322</pages><issn>1045-9219</issn><eissn>1558-2183</eissn><coden>ITDSEO</coden><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.</abstract><cop>Los Alamitos, CA</cop><pub>IEEE</pub><doi>10.1109/71.553301</doi><tpages>16</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1045-9219 |
| ispartof | IEEE transactions on parallel and distributed systems, 1996-12, Vol.7 (12), p.1307-1322 |
| issn | 1045-9219 1558-2183 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_71_553301 |
| source | IEEE Electronic Library (IEL) |
| subjects | Application software Applied sciences Automata Communication channels Computer displays Computer science control theory systems Concurrent computing Control system analysis Control system synthesis Control theory. Systems Exact sciences and technology FETs History Information analysis Software Software engineering Software systems System recovery |
| title | An application of Petri net reduction for Ada tasking deadlock analysis |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T19%3A26%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20application%20of%20Petri%20net%20reduction%20for%20Ada%20tasking%20deadlock%20analysis&rft.jtitle=IEEE%20transactions%20on%20parallel%20and%20distributed%20systems&rft.au=Shatz,%20S.M.&rft.date=1996-12-01&rft.volume=7&rft.issue=12&rft.spage=1307&rft.epage=1322&rft.pages=1307-1322&rft.issn=1045-9219&rft.eissn=1558-2183&rft.coden=ITDSEO&rft_id=info:doi/10.1109/71.553301&rft_dat=%3Cproquest_RIE%3E26300594%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=26300594&rft_id=info:pmid/&rft_ieee_id=553301&rfr_iscdi=true |