Deciding true concurrency equivalences on safe, finite nets
We show that the pomset-trace equivalence problem for 1-safe, finite Petri nets is decidable; in fact it is complete for expspace. We also show that history-preserving bisimulation between such nets is complete for dexptime. Our methods also yield tight complexity bounds for several other “true conc...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science 1996-01, Vol.154 (1), p.107-143 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 143 |
|---|---|
| container_issue | 1 |
| container_start_page | 107 |
| container_title | Theoretical computer science |
| container_volume | 154 |
| creator | Jategaonkar, Lalita Meyer, Albert R. |
| description | We show that the pomset-trace equivalence problem for 1-safe, finite Petri nets is decidable; in fact it is complete for
expspace. We also show that history-preserving bisimulation between such nets is complete for
dexptime. Our methods also yield tight complexity bounds for several other “true concurrency” and interleaving equivalences. The results are independent of the presence of hidden transitions. |
| doi_str_mv | 10.1016/0304-3975(95)00132-8 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_26125475</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>0304397595001328</els_id><sourcerecordid>26125475</sourcerecordid><originalsourceid>FETCH-LOGICAL-c381t-16f711981806ea3bc8e04b50287a5ed8682439ad480f9033c5fb1d981b0e5f7c3</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouK7-Aw85iYLVfDYJgiDrJyx40XNI04lEuu2atAv7721d8ehcZg7P-8I8CJ1SckUJLa8JJ6LgRslzIy8IoZwVeg_NqFamYMyIfTT7Qw7RUc6fZBypyhm6uQcf69h-4D4NgH3X-iElaP0Ww9cQN64Zb8i4a3F2AS5xiG3sAbfQ52N0EFyT4eR3z9H748Pb4rlYvj69LO6Wheea9gUtg6LUaKpJCY5XXgMRlSRMKyeh1qVmghtXC02CIZx7GSpaj3xFQAbl-Ryd7XrXqfsaIPd2FbOHpnEtdEO2rKRMCiVHUOxAn7qcEwS7TnHl0tZSYidTdtJgJw3WSPtjyuoxdruLwfjEJkKy2cfp7Tom8L2tu_h_wTdYa26a</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>26125475</pqid></control><display><type>article</type><title>Deciding true concurrency equivalences on safe, finite nets</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>Access via ScienceDirect (Elsevier)</source><creator>Jategaonkar, Lalita ; Meyer, Albert R.</creator><creatorcontrib>Jategaonkar, Lalita ; Meyer, Albert R.</creatorcontrib><description>We show that the pomset-trace equivalence problem for 1-safe, finite Petri nets is decidable; in fact it is complete for
expspace. We also show that history-preserving bisimulation between such nets is complete for
dexptime. Our methods also yield tight complexity bounds for several other “true concurrency” and interleaving equivalences. The results are independent of the presence of hidden transitions.</description><identifier>ISSN: 0304-3975</identifier><identifier>EISSN: 1879-2294</identifier><identifier>DOI: 10.1016/0304-3975(95)00132-8</identifier><language>eng</language><publisher>Elsevier B.V</publisher><ispartof>Theoretical computer science, 1996-01, Vol.154 (1), p.107-143</ispartof><rights>1996</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c381t-16f711981806ea3bc8e04b50287a5ed8682439ad480f9033c5fb1d981b0e5f7c3</citedby><cites>FETCH-LOGICAL-c381t-16f711981806ea3bc8e04b50287a5ed8682439ad480f9033c5fb1d981b0e5f7c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/0304-3975(95)00132-8$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Jategaonkar, Lalita</creatorcontrib><creatorcontrib>Meyer, Albert R.</creatorcontrib><title>Deciding true concurrency equivalences on safe, finite nets</title><title>Theoretical computer science</title><description>We show that the pomset-trace equivalence problem for 1-safe, finite Petri nets is decidable; in fact it is complete for
expspace. We also show that history-preserving bisimulation between such nets is complete for
dexptime. Our methods also yield tight complexity bounds for several other “true concurrency” and interleaving equivalences. The results are independent of the presence of hidden transitions.</description><issn>0304-3975</issn><issn>1879-2294</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1996</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAQhoMouK7-Aw85iYLVfDYJgiDrJyx40XNI04lEuu2atAv7721d8ehcZg7P-8I8CJ1SckUJLa8JJ6LgRslzIy8IoZwVeg_NqFamYMyIfTT7Qw7RUc6fZBypyhm6uQcf69h-4D4NgH3X-iElaP0Ww9cQN64Zb8i4a3F2AS5xiG3sAbfQ52N0EFyT4eR3z9H748Pb4rlYvj69LO6Wheea9gUtg6LUaKpJCY5XXgMRlSRMKyeh1qVmghtXC02CIZx7GSpaj3xFQAbl-Ryd7XrXqfsaIPd2FbOHpnEtdEO2rKRMCiVHUOxAn7qcEwS7TnHl0tZSYidTdtJgJw3WSPtjyuoxdruLwfjEJkKy2cfp7Tom8L2tu_h_wTdYa26a</recordid><startdate>19960101</startdate><enddate>19960101</enddate><creator>Jategaonkar, Lalita</creator><creator>Meyer, Albert R.</creator><general>Elsevier B.V</general><scope>6I.</scope><scope>AAFTH</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>19960101</creationdate><title>Deciding true concurrency equivalences on safe, finite nets</title><author>Jategaonkar, Lalita ; Meyer, Albert R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c381t-16f711981806ea3bc8e04b50287a5ed8682439ad480f9033c5fb1d981b0e5f7c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1996</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jategaonkar, Lalita</creatorcontrib><creatorcontrib>Meyer, Albert R.</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</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>Theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jategaonkar, Lalita</au><au>Meyer, Albert R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Deciding true concurrency equivalences on safe, finite nets</atitle><jtitle>Theoretical computer science</jtitle><date>1996-01-01</date><risdate>1996</risdate><volume>154</volume><issue>1</issue><spage>107</spage><epage>143</epage><pages>107-143</pages><issn>0304-3975</issn><eissn>1879-2294</eissn><abstract>We show that the pomset-trace equivalence problem for 1-safe, finite Petri nets is decidable; in fact it is complete for
expspace. We also show that history-preserving bisimulation between such nets is complete for
dexptime. Our methods also yield tight complexity bounds for several other “true concurrency” and interleaving equivalences. The results are independent of the presence of hidden transitions.</abstract><pub>Elsevier B.V</pub><doi>10.1016/0304-3975(95)00132-8</doi><tpages>37</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0304-3975 |
| ispartof | Theoretical computer science, 1996-01, Vol.154 (1), p.107-143 |
| issn | 0304-3975 1879-2294 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_26125475 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; Access via ScienceDirect (Elsevier) |
| title | Deciding true concurrency equivalences on safe, finite nets |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T03%3A29%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Deciding%20true%20concurrency%20equivalences%20on%20safe,%20finite%20nets&rft.jtitle=Theoretical%20computer%20science&rft.au=Jategaonkar,%20Lalita&rft.date=1996-01-01&rft.volume=154&rft.issue=1&rft.spage=107&rft.epage=143&rft.pages=107-143&rft.issn=0304-3975&rft.eissn=1879-2294&rft_id=info:doi/10.1016/0304-3975(95)00132-8&rft_dat=%3Cproquest_cross%3E26125475%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=26125475&rft_id=info:pmid/&rft_els_id=0304397595001328&rfr_iscdi=true |