Data structures and terminating Petri nets

Data structures and terminating Petri nets

Consider a collection of particles of various types, and a set of reactions that are allowed to take place among these particles. Each reaction is defined by an input linear combination of particle types, and an output linear combination of particle types. This framework (which is a Petri net) is sh...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Sleator, Daniel D.
Format: Buchkapitel
Sprache:eng
Schlagworte:
Check Transition
Cost Vector
External Node
Integer Linear Combination
Particle Type
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 497
container_issue
container_start_page 488
container_title
container_volume
creator Sleator, Daniel D.
description Consider a collection of particles of various types, and a set of reactions that are allowed to take place among these particles. Each reaction is defined by an input linear combination of particle types, and an output linear combination of particle types. This framework (which is a Petri net) is shown to model the cost of updating several standard data structures, the amortized cost of counting in various number systems and the space consumption of persistent data structures. A proof that the system of reactions is guaranteed to terminate gives a bound on the cost of the corresponding data structure problem. I show how linear programming can be used to analyze these systems.
doi_str_mv 10.1007/BFb0023850
format Book Chapter
fullrecord <record><control><sourceid>springer</sourceid><recordid>TN_cdi_springer_books_10_1007_BFb0023850</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>springer_books_10_1007_BFb0023850</sourcerecordid><originalsourceid>FETCH-LOGICAL-s188t-9c8fc7b06517412ce53ca0d07ae4f75b89d1befbfdaf59666ec84da1161b20ea3</originalsourceid><addsrcrecordid>eNpFUEtLxDAY_HyBde3FX9CjCNXvy6NJjrq6KizoQc8lSROpj64k2f9vFwXnMocZhpkBOCO8JER1dbNyiIxriXtwwqVAoZAY34eKOqKWc2EOoDZK7zQpmRZ4CBVyZK1Rgh9DnfM7zuBMzOYKLm5tsU0uaevLNoXc2GloSkhf42TLOL01z6GksZlCyadwFO1nDvUfL-B1dfeyfGjXT_ePy-t1m0nr0hqvo1cOO0lKEPNBcm9xQGWDiEo6bQZyIbo42ChN13XBazFYmgc4hsHyBZz_5ubvNDcIqXebzUfuCfvdB_3_B_wHw5tJFA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Data structures and terminating Petri nets</title><source>Springer Books</source><creator>Sleator, Daniel D.</creator><contributor>Simon, Imre</contributor><creatorcontrib>Sleator, Daniel D. ; Simon, Imre</creatorcontrib><description>Consider a collection of particles of various types, and a set of reactions that are allowed to take place among these particles. Each reaction is defined by an input linear combination of particle types, and an output linear combination of particle types. This framework (which is a Petri net) is shown to model the cost of updating several standard data structures, the amortized cost of counting in various number systems and the space consumption of persistent data structures. A proof that the system of reactions is guaranteed to terminate gives a bound on the cost of the corresponding data structure problem. I show how linear programming can be used to analyze these systems.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540552840</identifier><identifier>ISBN: 3540552847</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540470123</identifier><identifier>EISBN: 9783540470120</identifier><identifier>DOI: 10.1007/BFb0023850</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Check Transition ; Cost Vector ; External Node ; Integer Linear Combination ; Particle Type</subject><ispartof>LATIN '92, 1992, p.488-497</ispartof><rights>Springer-Verlag Berlin Heidelberg 1992</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/BFb0023850$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/BFb0023850$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>775,776,780,789,27904,38234,41421,42490</link.rule.ids></links><search><contributor>Simon, Imre</contributor><creatorcontrib>Sleator, Daniel D.</creatorcontrib><title>Data structures and terminating Petri nets</title><title>LATIN '92</title><description>Consider a collection of particles of various types, and a set of reactions that are allowed to take place among these particles. Each reaction is defined by an input linear combination of particle types, and an output linear combination of particle types. This framework (which is a Petri net) is shown to model the cost of updating several standard data structures, the amortized cost of counting in various number systems and the space consumption of persistent data structures. A proof that the system of reactions is guaranteed to terminate gives a bound on the cost of the corresponding data structure problem. I show how linear programming can be used to analyze these systems.</description><subject>Check Transition</subject><subject>Cost Vector</subject><subject>External Node</subject><subject>Integer Linear Combination</subject><subject>Particle Type</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540552840</isbn><isbn>3540552847</isbn><isbn>3540470123</isbn><isbn>9783540470120</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>1992</creationdate><recordtype>book_chapter</recordtype><sourceid/><recordid>eNpFUEtLxDAY_HyBde3FX9CjCNXvy6NJjrq6KizoQc8lSROpj64k2f9vFwXnMocZhpkBOCO8JER1dbNyiIxriXtwwqVAoZAY34eKOqKWc2EOoDZK7zQpmRZ4CBVyZK1Rgh9DnfM7zuBMzOYKLm5tsU0uaevLNoXc2GloSkhf42TLOL01z6GksZlCyadwFO1nDvUfL-B1dfeyfGjXT_ePy-t1m0nr0hqvo1cOO0lKEPNBcm9xQGWDiEo6bQZyIbo42ChN13XBazFYmgc4hsHyBZz_5ubvNDcIqXebzUfuCfvdB_3_B_wHw5tJFA</recordid><startdate>19920101</startdate><enddate>19920101</enddate><creator>Sleator, Daniel D.</creator><general>Springer Berlin Heidelberg</general><scope/></search><sort><creationdate>19920101</creationdate><title>Data structures and terminating Petri nets</title><author>Sleator, Daniel D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-s188t-9c8fc7b06517412ce53ca0d07ae4f75b89d1befbfdaf59666ec84da1161b20ea3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Check Transition</topic><topic>Cost Vector</topic><topic>External Node</topic><topic>Integer Linear Combination</topic><topic>Particle Type</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sleator, Daniel D.</creatorcontrib></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sleator, Daniel D.</au><au>Simon, Imre</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Data structures and terminating Petri nets</atitle><btitle>LATIN '92</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>1992-01-01</date><risdate>1992</risdate><spage>488</spage><epage>497</epage><pages>488-497</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540552840</isbn><isbn>3540552847</isbn><eisbn>3540470123</eisbn><eisbn>9783540470120</eisbn><abstract>Consider a collection of particles of various types, and a set of reactions that are allowed to take place among these particles. Each reaction is defined by an input linear combination of particle types, and an output linear combination of particle types. This framework (which is a Petri net) is shown to model the cost of updating several standard data structures, the amortized cost of counting in various number systems and the space consumption of persistent data structures. A proof that the system of reactions is guaranteed to terminate gives a bound on the cost of the corresponding data structure problem. I show how linear programming can be used to analyze these systems.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/BFb0023850</doi><tpages>10</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof LATIN '92, 1992, p.488-497
issn 0302-9743
1611-3349
language eng
recordid cdi_springer_books_10_1007_BFb0023850
source Springer Books
subjects Check Transition
Cost Vector
External Node
Integer Linear Combination
Particle Type
title Data structures and terminating Petri nets
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T23%3A26%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-springer&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Data%20structures%20and%20terminating%20Petri%20nets&rft.btitle=LATIN%20'92&rft.au=Sleator,%20Daniel%20D.&rft.date=1992-01-01&rft.spage=488&rft.epage=497&rft.pages=488-497&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540552840&rft.isbn_list=3540552847&rft_id=info:doi/10.1007/BFb0023850&rft_dat=%3Cspringer%3Espringer_books_10_1007_BFb0023850%3C/springer%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540470123&rft.eisbn_list=9783540470120&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true